Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems Yuyuan OuyangYangyang Xu Full Length Paper 07 August 2019 Pages: 1 - 35
Multidimensional sum-up rounding for integer programming in optimal experimental design Jing YuMihai Anitescu Full Length Paper 06 September 2019 Pages: 37 - 76
A differentiable homotopy method to compute perfect equilibria Yin ChenChuangyin Dang Full Length Paper 14 August 2019 Pages: 77 - 109
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming Liang ChenXudong LiKim-Chuan Toh Full Length Paper 26 August 2019 Pages: 111 - 161
Mixed-integer bilevel representability Amitabh BasuChristopher Thomas RyanSriram Sankaranarayanan Full Length Paper 27 August 2019 Pages: 163 - 197
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming Yangyang Xu Full Length Paper 21 August 2019 Pages: 199 - 244
Shorter tours and longer detours: uniform covers and a bit beyond Arash HaddadanAlantha NewmanR. Ravi Full Length Paper 21 August 2019 Pages: 245 - 273
New polyhedral and algorithmic results on greedoids Dávid Szeszlér Full Length Paper Open access 26 August 2019 Pages: 275 - 296
Lower bounds for finding stationary points II: first-order methods Yair CarmonJohn C. DuchiAaron Sidford Full Length Paper 20 September 2019 Pages: 315 - 355
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria D. DrusvyatskiyA. D. IoffeA. S. Lewis Full Length Paper 27 September 2019 Pages: 357 - 383
Multi-marginal maximal monotonicity and convex analysis Sedi BartzHeinz H. BauschkeXianfu Wang Full Length Paper 14 September 2019 Pages: 385 - 408
Distributionally robust polynomial chance-constraints under mixture ambiguity sets Jean B. LasserreTillmann Weisser Full Length Paper 16 September 2019 Pages: 409 - 453
Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation Lei GuoXiaojun Chen Full Length Paper 24 September 2019 Pages: 455 - 485
Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version Ruoyu SunYinyu Ye Full Length Paper 11 October 2019 Pages: 487 - 520