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 30 matches
- 2022
- Jianchao Bai, William W. Hager, Hongchao Zhang:
An inexact accelerated stochastic ADMM for separable convex optimization. Comput. Optim. Appl. 81(2): 479-518 (2022) - Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang:
Finding best approximation pairs for two intersections of closed convex sets. Comput. Optim. Appl. 81(1): 289-308 (2022) - Ernesto G. Birgin, José Mario Martínez:
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients. Comput. Optim. Appl. 81(3): 689-715 (2022) - Sergio Cavero, Eduardo G. Pardo, Abraham Duarte:
A general variable neighborhood search for the cyclic antibandwidth problem. Comput. Optim. Appl. 81(2): 657-687 (2022) - Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels:
A sublevel moment-SOS hierarchy for polynomial optimization. Comput. Optim. Appl. 81(1): 31-66 (2022) - Kwassi Joseph Dzahini:
Expected complexity analysis of stochastic direct-search. Comput. Optim. Appl. 81(1): 179-200 (2022) - Mengya Feng, Tongjun Sun:
A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties. Comput. Optim. Appl. 81(3): 889-921 (2022) - Orizon Pereira Ferreira, Max Lemes, Leandro da Fonseca Prudente:
On the inexact scaled gradient projection method. Comput. Optim. Appl. 81(1): 91-125 (2022) - Bin Gao, Pierre-Antoine Absil:
A Riemannian rank-adaptive method for low-rank matrix completion. Comput. Optim. Appl. 81(1): 67-90 (2022) - Michael Haythorpe, Walter Murray:
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem. Comput. Optim. Appl. 81(1): 309-336 (2022) - Na Huang:
On R-linear convergence analysis for a class of gradient methods. Comput. Optim. Appl. 81(1): 161-177 (2022) - Yakui Huang, Yu-Hong Dai, Xin-Wei Liu, Hongchao Zhang:
On the acceleration of the Barzilai-Borwein method. Comput. Optim. Appl. 81(3): 717-740 (2022) - Pengfei Huang, Qingzhi Yang, Yuning Yang:
Finding the global optimum of a class of quartic minimization problem. Comput. Optim. Appl. 81(3): 923-954 (2022) - Xin Jiang, Lieven Vandenberghe:
Bregman primal-dual first-order method and application to sparse semidefinite programming. Comput. Optim. Appl. 81(1): 127-159 (2022) - Barbara Kaltenbacher, Kha Van Huynh:
Iterative regularization for constrained minimization formulations of nonlinear inverse problems. Comput. Optim. Appl. 81(2): 569-611 (2022) - Donghui Li, Xiaozhou Wang, Jiajian Huang:
Diagonal BFGS updates and applications to the limited memory BFGS method. Comput. Optim. Appl. 81(3): 829-856 (2022) - Xiubo Liang, Guoqiang Wang, Bo Yu:
A reduced proximal-point homotopy method for large-scale non-convex BQP. Comput. Optim. Appl. 81(2): 539-567 (2022) - Christian von Lücken, Carlos A. Brizuela, Benjamín Barán:
Clustering-based multipopulation approaches in MOEA/D for many-objective problems. Comput. Optim. Appl. 81(3): 789-828 (2022) - Alberto De Marchi:
On a primal-dual Newton proximal method for convex quadratic programs. Comput. Optim. Appl. 81(2): 369-395 (2022) - José Mario Martínez, Lúcio Tunes Santos:
On large-scale unconstrained optimization and arbitrary regularization. Comput. Optim. Appl. 81(1): 1-30 (2022) - Dominique Monnet, Warren L. Hare, Yves Lucet:
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design. Comput. Optim. Appl. 81(3): 741-767 (2022) - Elisha R. Pager, Anil V. Rao:
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation. Comput. Optim. Appl. 81(3): 857-887 (2022) - Viviana A. Ramirez, Graciela N. Sottosanto:
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems. Comput. Optim. Appl. 81(3): 769-788 (2022) - Alessandro Scagliotti, Piero Colli Franzone:
A piecewise conservative method for unconstrained convex optimization. Comput. Optim. Appl. 81(1): 251-288 (2022) - Meenarli Sharma, Prashant Palkar, Ashutosh Mahajan:
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization. Comput. Optim. Appl. 81(2): 423-478 (2022) - Murwan Siddig, Yongjia Song:
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse. Comput. Optim. Appl. 81(1): 201-250 (2022) - Fanrong Xie, Anuj Sharma, Zuoan Li:
An alternate approach to solve two-level priority based assignment problem. Comput. Optim. Appl. 81(2): 613-656 (2022) - Yuya Yamakawa, Hiroyuki Sato:
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method. Comput. Optim. Appl. 81(2): 397-421 (2022) - Quan Yu, Xinzhen Zhang:
A smoothing proximal gradient algorithm for matrix rank minimization problem. Comput. Optim. Appl. 81(2): 519-538 (2022) - Liaoyuan Zeng, Ting Kei Pong:
ρ-regularization subproblems: strong duality and an eigensolver-based algorithm. Comput. Optim. Appl. 81(2): 337-368 (2022)
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-06 14:03 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