Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2020
- Maicon Marques Alves, Jonathan Eckstein, Marina Geremia, Jefferson G. Melo:
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms. Comput. Optim. Appl. 75(2): 389-422 (2020) - Rodolfo G. Begiato, Ana Luísa Custódio, Márcia A. Gomes-Ruggiero:
A global hybrid derivative-free method for high-dimensional systems of nonlinear equations. Comput. Optim. Appl. 75(1): 93-112 (2020) - Glaydston de Carvalho Bento, Sandro Dimy Barbosa Bitar, João Xavier da Cruz Neto, Antoine Soubeyran, João Carlos de Oliveira Souza:
A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems. Comput. Optim. Appl. 75(1): 263-290 (2020) - Enrico Bettiol, Lucas Létocart, Francesco Rinaldi, Emiliano Traversi:
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs. Comput. Optim. Appl. 75(2): 321-360 (2020) - Nicolas Boutet, Rob Haelterman, Joris Degroote:
Secant update version of quasi-Newton PSB with weighted multisecant equations. Comput. Optim. Appl. 75(2): 441-466 (2020) - Carmo P. Brás, José Mario Martínez, Marcos Raydan:
Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization. Comput. Optim. Appl. 75(1): 169-205 (2020) - Bilian Chen, Zhening Li:
On the tensor spectral p-norm and its dual norm via partitions. Comput. Optim. Appl. 75(3): 609-628 (2020) - Pin-Bo Chen, Peng Zhang, Xide Zhu, Gui-Hua Lin:
Modified Jacobian smoothing method for nonsmooth complementarity problems. Comput. Optim. Appl. 75(1): 207-235 (2020) - Lulu Cheng, Xinzhen Zhang:
A semidefinite relaxation method for second-order cone polynomial complementarity problems. Comput. Optim. Appl. 75(3): 629-647 (2020) - Weijie Cong, Le Wang, Hui Sun:
Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem. Comput. Optim. Appl. 75(1): 237-262 (2020) - Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural:
Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances. Comput. Optim. Appl. 75(2): 537-560 (2020) - Shouqiang Du, Maolin Che, Yimin Wei:
Stochastic structured tensors to stochastic complementarity problems. Comput. Optim. Appl. 75(3): 649-668 (2020) - Olivier Fercoq, Zheng Qu:
Restarting the accelerated coordinate descent method with a rough strong convexity estimate. Comput. Optim. Appl. 75(1): 63-91 (2020) - Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg:
Empirical study of exact algorithms for the multi-objective spanning tree. Comput. Optim. Appl. 75(2): 561-605 (2020) - Leonardo Galli, Alessandro Galligari, Marco Sciandrone:
A unified convergence framework for nonmonotone inexact decomposition methods. Comput. Optim. Appl. 75(1): 113-144 (2020) - Martin Glanzer, Georg Ch. Pflug:
Multiscale stochastic optimization: modeling aspects and scenario generation. Comput. Optim. Appl. 75(1): 1-34 (2020) - Feng Guo, Xiaoxia Sun:
On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems. Comput. Optim. Appl. 75(3): 669-699 (2020) - Bingsheng He, Feng Ma, Xiaoming Yuan:
Optimally linearizing the alternating direction method of multipliers for convex programming. Comput. Optim. Appl. 75(2): 361-388 (2020) - Shenglong Hu:
An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors. Comput. Optim. Appl. 75(3): 701-737 (2020) - Ken Kobayashi, Yuichi Takano:
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems. Comput. Optim. Appl. 75(2): 493-513 (2020) - Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi, Saïd Hanafi:
Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance. Comput. Optim. Appl. 75(1): 291-320 (2020) - Zexian Liu, Hongwei Liu, Yu-Hong Dai:
An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization. Comput. Optim. Appl. 75(1): 145-167 (2020) - Dominique Monnet, Warren L. Hare, Yves Lucet:
Fast feasibility check of the multi-material vertical alignment problem in road design. Comput. Optim. Appl. 75(2): 515-536 (2020) - Jiawang Nie:
Preface to the special issue on optimization with polynomials and tensors. Comput. Optim. Appl. 75(3): 607-608 (2020) - Tao Sun, Yuejiao Sun, Yangyang Xu, Wotao Yin:
Markov chain block coordinate descent. Comput. Optim. Appl. 75(1): 35-61 (2020) - Xuezhong Wang, Maolin Che, Yimin Wei:
Tensor neural network models for tensor singular value decompositions. Comput. Optim. Appl. 75(3): 753-777 (2020) - Xiao Wang, Xinzhen Zhang, Guangming Zhou:
SDP relaxation algorithms for $\mathbf {P}(\mathbf {P}_0)$-tensor detection. Comput. Optim. Appl. 75(3): 739-752 (2020) - Jun Yang, Hongwei Liu:
A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities. Comput. Optim. Appl. 75(2): 423-440 (2020) - Mengshi Zhang, Guyan Ni, Guofeng Zhang:
Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement. Comput. Optim. Appl. 75(3): 779-798 (2020) - Qi Zhao, Zhongwen Chen:
A line search exact penalty method for nonlinear semidefinite programming. Comput. Optim. Appl. 75(2): 467-491 (2020)
skipping 2 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-30 11:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint