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 122 matches
- 2023
- Lennart Baardman, Rares Cristian, Georgia Perakis, Divya Singhvi, Omar Skali Lami, Leann Thayaparan:
The role of optimization in some recent advances in data-driven decision-making. Math. Program. 200(1): 1-35 (2023) - Catherine Babecki, Rekha R. Thomas:
Graphical designs and gale duality. Math. Program. 200(2): 703-737 (2023) - Lorenzo Baldi, Bernard Mourrain:
On the effective Putinar's Positivstellensatz and moment approximation. Math. Program. 200(1): 71-103 (2023) - Gilles Bareilles, Franck Iutzeler, Jérôme Malick:
Newton acceleration on manifolds identified by proximal gradient methods. Math. Program. 200(1): 37-70 (2023) - Amitabh Basu:
Complexity of optimizing over the integers. Math. Program. 200(2): 739-780 (2023) - René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking:
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200(1): 319-355 (2023) - Dimitris Bertsimas, Dick den Hertog, Jean Pauphilet, Jianzhe Zhen:
Robust convex optimization: A new perspective that unifies and extends. Math. Program. 200(2): 877-918 (2023) - Radu Ioan Bot, Ernö Robert Csetnek, Dang-Khoa Nguyen:
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. Math. Program. 200(1): 147-197 (2023) - Coralia Cartis, Estelle M. Massart, Adilet Otemissov:
Global optimization using random embeddings. Math. Program. 200(2): 781-829 (2023) - Yu-Hong Dai, Liwei Zhang:
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation. Math. Program. 200(2): 633-667 (2023) - Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan:
Special Issue: International Symposium on Mathematical Programming 2022. Math. Program. 200(2): 629-631 (2023) - Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. 200(1): 569-587 (2023) - Hao Hu, Renata Sotirov, Henry Wolkowicz:
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. Math. Program. 200(1): 475-529 (2023) - Lei Huang, Jiawang Nie, Ya-Xiang Yuan:
Homogenization for polynomial optimization with unbounded sets. Math. Program. 200(1): 105-145 (2023) - Qiujiang Jin, Aryan Mokhtari:
Non-asymptotic superlinear convergence of standard quasi-Newton methods. Math. Program. 200(1): 425-473 (2023) - Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - Xiaocheng Li, Chunlin Sun, Yinyu Ye:
Simple and fast algorithm for binary integer and online linear programming. Math. Program. 200(2): 831-875 (2023) - Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong:
Error bounds, facial residual functions and applications to the exponential cone. Math. Program. 200(1): 229-278 (2023) - Shuyang Ling:
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis. Math. Program. 200(1): 589-628 (2023) - Peijing Liu, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz:
A graph-based decomposition method for convex quadratic optimization with indicators. Math. Program. 200(2): 669-701 (2023) - Alberto Del Pia, Mingchen Ma:
k-median: exact recovery in the extended stochastic ball model. Math. Program. 200(1): 357-423 (2023) - Hailin Sun, Alexander Shapiro, Xiaojun Chen:
Distributionally robust stochastic variational inequalities. Math. Program. 200(1): 279-317 (2023) - Takashi Tsuchiya, Bruno F. Lourenço, Masakazu Muramatsu, Takayuki Okuno:
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms. Math. Program. 200(1): 531-568 (2023) - 2018
- Shabbir Ahmed, Weijun Xie:
Relaxations and approximations of chance constraints under finite distributions. Math. Program. 170(1): 43-65 (2018) - Maria Soledad Aronna, J. Frédéric Bonnans, Axel Kröner:
Correction to: Optimal control of infinite dimensional bilinear systems: application to the heat and wave equations. Math. Program. 170(2): 569-570 (2018) - Sebastián Arpón, Tito Homem-de-Mello, Bernardo K. Pagnoncelli:
Scenario reduction for stochastic programs with Conditional Value-at-Risk. Math. Program. 170(1): 327-356 (2018) - Alper Atamtürk, Andrés Gómez:
Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170(1): 141-176 (2018) - Patrick L. Combettes:
Monotone operator theory in convex optimization. Math. Program. 170(1): 177-206 (2018) - Alison Cozad, Nikolaos V. Sahinidis:
A global MINLP approach to symbolic regression. Math. Program. 170(1): 97-119 (2018) - Sanjeeb Dash, Oktay Günlük, Robert Hildebrand:
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170(1): 207-236 (2018)
skipping 92 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-09-27 15:32 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