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
- 2023
- Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex downgrading to minimize connectivity. Math. Program. 199(1): 215-249 (2023) - Jason M. Altschuler, Enric Boix-Adserà:
Polynomial-time algorithms for multimarginal optimal transport problems with structure. Math. Program. 199(1): 1107-1178 (2023) - Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità:
Node connectivity augmentation via iterative randomized rounding. Math. Program. 199(1): 995-1031 (2023) - Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, Blake E. Woodworth:
Lower bounds for non-convex stochastic optimization. Math. Program. 199(1): 165-214 (2023) - I. E. Bardakci, Afrooz Jalilzadeh, Constantino M. Lagoa, Uday V. Shanbhag:
Probability maximization via Minkowski functionals: convex representations and tractable resolution. Math. Program. 199(1): 595-637 (2023) - Coralia Cartis, Lindon Roberts:
Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. 199(1): 461-524 (2023) - Juan Pablo Contreras, Roberto Cominetti:
Optimal error bounds for non-expansive fixed-point iterations in normed spaces. Math. Program. 199(1): 343-374 (2023) - Santanu S. Dey, Marco Molinaro, Guanyi Wang:
Solving sparse principal component analysis with global support. Math. Program. 199(1): 421-459 (2023) - Yann Disser, Oliver Friedmann, Alexander V. Hopp:
An exponential lower bound for Zadeh's pivot rule. Math. Program. 199(1): 865-936 (2023) - Jean-Pierre Dussault, Jean Charles Gilbert:
Exact computation of an error bound for the balanced linear complementarity problem with unique solution. Math. Program. 199(1): 1221-1238 (2023) - Dan Garber:
Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity. Math. Program. 199(1): 87-121 (2023) - Shenglong Hu, Ke Ye:
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations. Math. Program. 199(1): 1305-1364 (2023) - Xiaoxi Jia, Christian Kanzow, Patrick Mehlitz, Gerd Wachsmuth:
An augmented Lagrangian method for optimization problems with structured geometric constraints. Math. Program. 199(1): 1365-1415 (2023) - Anatoli B. Juditsky, Joon Kwon, Éric Moulines:
Unifying mirror descent and dual averaging. Math. Program. 199(1): 793-830 (2023) - Lea Kapelevich, Chris Coey, Juan Pablo Vielma:
Sum of squares generalizations for conic sets. Math. Program. 199(1): 1417-1429 (2023) - David Kozak, Cesare Molinari, Lorenzo Rosasco, Luis Tenorio, Silvia Villa:
Zeroth-order optimization with orthogonal random directions. Math. Program. 199(1): 1179-1219 (2023) - Eitan Levin, Joe Kileel, Nicolas Boumal:
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy. Math. Program. 199(1): 831-864 (2023) - Andrea Lodi, Mathieu Tanneau, Juan Pablo Vielma:
Disjunctive cuts in Mixed-Integer Conic Optimization. Math. Program. 199(1): 671-719 (2023) - Sen Na, Mihai Anitescu, Mladen Kolar:
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians. Math. Program. 199(1): 721-791 (2023) - Takayuki Okuno, Masao Fukushima:
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints. Math. Program. 199(1): 251-303 (2023) - Roberto I. Oliveira, Philip Thompson:
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints. Math. Program. 199(1): 1-48 (2023) - Roberto I. Oliveira, Philip Thompson:
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso. Math. Program. 199(1): 49-86 (2023) - Tien-Son Pham:
Tangencies and polynomial optimization. Math. Program. 199(1): 1239-1272 (2023) - R. Tyrrell Rockafellar:
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming. Math. Program. 199(1): 375-420 (2023) - Anton Rodomanov, Yurii E. Nesterov:
Subgradient ellipsoid method for nonsmooth convex problems. Math. Program. 199(1): 305-341 (2023) - Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn:
Semi-discrete optimal transport: hardness, regularization and numerical solution. Math. Program. 199(1): 1033-1106 (2023) - Adrien B. Taylor, Yoel Drori:
An optimal gradient method for smooth strongly convex minimization. Math. Program. 199(1): 557-594 (2023) - Melanie Weber, Suvrit Sra:
Riemannian Optimization via Frank-Wolfe Methods. Math. Program. 199(1): 525-556 (2023) - Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. Math. Program. 199(1): 937-993 (2023) - Haishan Ye, Dachao Lin, Xiangyu Chang, Zhihua Zhang:
Towards explicit superlinear convergence rate for SR1. Math. Program. 199(1): 1273-1303 (2023)
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-10-16 04:06 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