1. Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems

   • Yuyuan Ouyang
   • Yangyang Xu

   Full Length Paper 07 August 2019 Pages: 1 - 35

   

2. Multidimensional sum-up rounding for integer programming in optimal experimental design

   • Jing Yu
   • Mihai Anitescu

   Full Length Paper 06 September 2019 Pages: 37 - 76

   

3. A differentiable homotopy method to compute perfect equilibria

   • Yin Chen
   • Chuangyin Dang

   Full Length Paper 14 August 2019 Pages: 77 - 109

   

4. On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming

   • Liang Chen
   • Xudong Li
   • Kim-Chuan Toh

   Full Length Paper 26 August 2019 Pages: 111 - 161

   

5. Mixed-integer bilevel representability

   • Amitabh Basu
   • Christopher Thomas Ryan
   • Sriram Sankaranarayanan

   Full Length Paper 27 August 2019 Pages: 163 - 197

   

6. Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming

   • Yangyang Xu

   Full Length Paper 21 August 2019 Pages: 199 - 244

   

7. Shorter tours and longer detours: uniform covers and a bit beyond

   • Arash Haddadan
   • Alantha Newman
   • R. Ravi

   Full Length Paper 21 August 2019 Pages: 245 - 273

   

8. New polyhedral and algorithmic results on greedoids

   • Dávid Szeszlér

   Full Length Paper Open access 26 August 2019 Pages: 275 - 296

   

9. Facets from gadgets

   • Adam N. Letchford
   • Anh N. Vu

   Full Length Paper 14 September 2019 Pages: 297 - 314

   

10. Lower bounds for finding stationary points II: first-order methods

    • Yair Carmon
    • John C. Duchi
    • Aaron Sidford

    Full Length Paper 20 September 2019 Pages: 315 - 355

    

11. Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria

    • D. Drusvyatskiy
    • A. D. Ioffe
    • A. S. Lewis

    Full Length Paper 27 September 2019 Pages: 357 - 383

12. Multi-marginal maximal monotonicity and convex analysis

    • Sedi Bartz
    • Heinz H. Bauschke
    • Xianfu Wang

    Full Length Paper 14 September 2019 Pages: 385 - 408

13. Distributionally robust polynomial chance-constraints under mixture ambiguity sets

    • Jean B. Lasserre
    • Tillmann Weisser

    Full Length Paper 16 September 2019 Pages: 409 - 453

    

14. Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation

    • Lei Guo
    • Xiaojun Chen

    Full Length Paper 24 September 2019 Pages: 455 - 485

    

15. Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version

    • Ruoyu Sun
    • Yinyu Ye

    Full Length Paper 11 October 2019 Pages: 487 - 520