default search action
Mathematical Programming, Volume 200
Volume 200, Number 1, June 2023
- Lennart Baardman
, Rares Cristian, Georgia Perakis
The role of optimization in some recent advances in data-driven decision-making. 1-35 - Gilles Bareilles, Franck Iutzeler
Newton acceleration on manifolds identified by proximal gradient methods. 37-70 - Lorenzo Baldi
On the effective Putinar's Positivstellensatz and moment approximation. 71-103 - Lei Huang
Homogenization for polynomial optimization with unbounded sets. 105-145 - Radu Ioan Bot
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. 147-197 - Dusan Knop, Martin Koutecký
High-multiplicity N-fold IP via configuration LP. 199-227 - Scott B. Lindstrom
Error bounds, facial residual functions and applications to the exponential cone. 229-278 - Hailin Sun
Distributionally robust stochastic variational inequalities. 279-317 - René Beier, Heiko Röglin
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. 319-355 - Alberto Del Pia
k-median: exact recovery in the extended stochastic ball model. 357-423 - Qiujiang Jin
Non-asymptotic superlinear convergence of standard quasi-Newton methods. 425-473 - Hao Hu, Renata Sotirov
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. 475-529 - 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. 531-568 - Santanu S. Dey, Yatharth Dubey
Branch-and-bound solves random binary IPs in poly(n)-time. 569-587 - Shuyang Ling
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis. 589-628
Volume 200, Number 2, July 2023
- Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan:
Special Issue: International Symposium on Mathematical Programming 2022. 629-631 - Yu-Hong Dai, Liwei Zhang:
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation. 633-667 - Peijing Liu, Salar Fattahi, Andrés Gómez
A graph-based decomposition method for convex quadratic optimization with indicators. 669-701 - Catherine Babecki
Graphical designs and gale duality. 703-737 - Amitabh Basu
Complexity of optimizing over the integers. 739-780 - Coralia Cartis
Global optimization using random embeddings. 781-829 - Xiaocheng Li, Chunlin Sun
Simple and fast algorithm for binary integer and online linear programming. 831-875 - Dimitris Bertsimas, Dick den Hertog, Jean Pauphilet, Jianzhe Zhen
Robust convex optimization: A new perspective that unifies and extends. 877-918
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.
last updated on 2025-02-18 01:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: