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 21 matches
- 2017
- Anuj Bajaj, Warren L. Hare, Yves Lucet:
Visualization of the \(\varepsilon \) -subdifferential of piecewise linear-quadratic functions. Comput. Optim. Appl. 67(2): 421-442 (2017) - Richard C. Barnard, Christian Clason:
(L1) penalization of volumetric dose objectives in optimal control of PDEs. Comput. Optim. Appl. 67(2): 401-419 (2017) - Matus Benko, Helmut Gfrerer:
An SQP method for mathematical programs with vanishing constraints with strong convergence properties. Comput. Optim. Appl. 67(2): 361-399 (2017) - Frank E. Curtis, Arvind U. Raghunathan:
Solving nearly-separable quadratic optimization problems as nonsmooth equations. Comput. Optim. Appl. 67(2): 317-360 (2017) - Nicholas I. M. Gould, Daniel P. Robinson:
A dual gradient-projection method for large-scale strictly convex quadratic problems. Comput. Optim. Appl. 67(1): 1-38 (2017) - Dang Van Hieu:
New subgradient extragradient methods for common solutions to equilibrium problems. Comput. Optim. Appl. 67(3): 571-594 (2017) - Alexey F. Izmailov, E. I. Uskov:
Subspace-stabilized sequential quadratic programming. Comput. Optim. Appl. 67(1): 129-154 (2017) - Baasansuren Jadamba, Akhtar A. Khan, Miguel Sama:
Error estimates for integral constraint regularization of state-constrained elliptic control problems. Comput. Optim. Appl. 67(1): 39-71 (2017) - Patrick R. Johnstone, Pierre Moulin:
Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions. Comput. Optim. Appl. 67(2): 259-292 (2017) - Teobaldo L. Bulhões Júnior, Anand Subramanian, Gilberto Farias de Sousa Filho, Lucídio dos Anjos F. Cabral:
Branch-and-price for p-cluster editing. Comput. Optim. Appl. 67(2): 293-316 (2017) - Christian Kanzow, Yekini Shehu:
Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces. Comput. Optim. Appl. 67(3): 595-620 (2017) - Tianxiang Liu, Ting Kei Pong:
Further properties of the forward-backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67(3): 489-520 (2017) - Xinhe Miao, Yu-Lin Chang, Jein-Shan Chen:
On merit functions for p-order cone complementarity problem. Comput. Optim. Appl. 67(1): 155-173 (2017) - Daniel O'Connor, Lieven Vandenberghe:
Total variation image deblurring with space-varying kernel. Comput. Optim. Appl. 67(3): 521-541 (2017) - Filippo Pecci, Edo Abraham, Ivan Stoianov:
Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks. Comput. Optim. Appl. 67(1): 201-223 (2017) - Dingtao Peng, Naihua Xiu, Jian Yu:
(S1/2) regularization methods and fixed point algorithms for affine rank minimization problems. Comput. Optim. Appl. 67(3): 543-569 (2017) - Biao Qu, Changyu Wang, Naihua Xiu:
Analysis on Newton projection method for the split feasibility problem. Comput. Optim. Appl. 67(1): 175-199 (2017) - Juan Carlos de los Reyes, E. Loayza, Pedro Merino:
Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\) -optimization. Comput. Optim. Appl. 67(2): 225-258 (2017) - Lorenzo Stella, Andreas Themelis, Panagiotis Patrinos:
Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3): 443-487 (2017) - Porfirio Suñagua, Aurelio R. L. Oliveira:
A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods. Comput. Optim. Appl. 67(1): 111-127 (2017) - Xiaojing Zhu:
A Riemannian conjugate gradient method for optimization on the Stiefel manifold. Comput. Optim. Appl. 67(1): 73-110 (2017)
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-10-03 07:23 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