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 20 matches
- 2021
- Vassilis Apidopoulos, Jean-François Aujol, Charles Dossal, Aude Rondepierre:
Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions. Math. Program. 187(1): 151-193 (2021) - Toni Böhnlein, Stefan Kratsch, Oliver Schaudt:
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. Math. Program. 187(1): 653-695 (2021) - Xiaojun Chen, Philippe L. Toint:
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. Math. Program. 187(1): 47-78 (2021) - Frank E. Curtis, Daniel P. Robinson:
Regional complexity analysis of algorithms for nonconvex smooth optimization. Math. Program. 187(1): 579-615 (2021) - Danial Davarnia, Willem-Jan van Hoeve:
Outer approximation for integer nonlinear programs via decision diagrams. Math. Program. 187(1): 111-150 (2021) - Andreas Fischer, Alexey F. Izmailov, Mikhail V. Solodov:
Unit stepsize for the Newton method close to critical solutions. Math. Program. 187(1): 697-721 (2021) - Christian Füllner, Peter Kirst, Oliver Stein:
Convergent upper bounds in global minimization with nonlinear equality constraints. Math. Program. 187(1): 617-651 (2021) - Serge Gratton, Ehouarn Simon, Philippe L. Toint:
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program. 187(1): 1-24 (2021) - Vincent Guigues:
Inexact stochastic mirror descent for two-stage nonlinear stochastic programs. Math. Program. 187(1): 533-577 (2021) - Bin Hu, Peter Seiler, Laurent Lessard:
Analysis of biased stochastic gradient descent using sequential semidefinite programs. Math. Program. 187(1): 383-408 (2021) - Matthias Köppe, Yuan Zhou:
Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem. Math. Program. 187(1): 195-252 (2021) - Guanghui Lan, Zhiqiang Zhou:
Dynamic stochastic approximation for multi-stage stochastic optimization. Math. Program. 187(1): 487-532 (2021) - Haihao Lu, Robert M. Freund:
Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization. Math. Program. 187(1): 317-349 (2021) - Javier Peña, Juan C. Vera, Luis F. Zuluaga:
New characterizations of Hoffman constants for systems of linear constraints. Math. Program. 187(1): 79-109 (2021) - Andreas Potschka, Hans Georg Bock:
A sequential homotopy method for mathematical programming problems. Math. Program. 187(1): 459-486 (2021) - Shi Pu, Angelia Nedic:
Distributed stochastic gradient tracking methods. Math. Program. 187(1): 409-457 (2021) - Christopher Thomas Ryan, Robert L. Smith:
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs. Math. Program. 187(1): 253-285 (2021) - Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
A simplex algorithm for rational cp-factorization. Math. Program. 187(1): 25-45 (2021) - Laurence A. Wolsey, Hande Yaman:
Convex hull results for generalizations of the constant capacity single node flow set. Math. Program. 187(1): 351-382 (2021) - Yong Xia, Mei-Jia Yang, Shu Wang:
Chebyshev center of the intersection of balls: complexity, relaxation and approximation. Math. Program. 187(1): 287-315 (2021)
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 2025-01-04 15:21 CET 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