default search action
Mathematical Programming, Volume 185
Volume 185, Number 1-2, January 2021
- Yuyuan Ouyang, Yangyang Xu:
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. 1-35 - Jing Yu, Mihai Anitescu:
Multidimensional sum-up rounding for integer programming in optimal experimental design. 37-76 - Yin Chen, Chuangyin Dang:
A differentiable homotopy method to compute perfect equilibria. 77-109 - Liang Chen, Xudong Li, Defeng Sun, Kim-Chuan Toh:
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming. 111-161 - Amitabh Basu, Christopher Thomas Ryan, Sriram Sankaranarayanan:
Mixed-integer bilevel representability. 163-197 - Yangyang Xu:
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. 199-244 - Arash Haddadan, Alantha Newman, R. Ravi:
Shorter tours and longer detours: uniform covers and a bit beyond. 245-273 - Dávid Szeszlér:
New polyhedral and algorithmic results on greedoids. 275-296 - Adam N. Letchford, Anh N. Vu:
Facets from gadgets. 297-314 - Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford:
Lower bounds for finding stationary points II: first-order methods. 315-355 - Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis:
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria. 357-383 - Sedi Bartz, Heinz H. Bauschke, Hung M. Phan, Xianfu Wang:
Multi-marginal maximal monotonicity and convex analysis. 385-408 - Jean B. Lasserre, Tillmann Weißer:
Distributionally robust polynomial chance-constraints under mixture ambiguity sets. 409-453 - Lei Guo, Xiaojun Chen:
Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation. 455-485 - Ruoyu Sun, Yinyu Ye:
Worst-case complexity of cyclic coordinate descent: O(n2) gap with randomized version. 487-520
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.