1. Amenable cones: error bounds without constraint qualifications

   • Bruno F. Lourenço

   Full Length Paper 07 November 2019 Pages: 1 - 48

   

2. Why random reshuffling beats stochastic gradient descent

   • M. Gürbüzbalaban
   • A. Ozdaglar
   • P. A. Parrilo

   Full Length Paper 29 October 2019 Pages: 49 - 84

   

3. Hypergraph k-cut in randomized polynomial time

   • Karthekeyan Chandrasekaran
   • Chao Xu
   • Xilin Yu

   Full Length Paper 13 November 2019 Pages: 85 - 113

   

4. On distributionally robust chance constrained programs with Wasserstein distance

   • Weijun Xie

   Full Length Paper 13 November 2019 Pages: 115 - 155

   

5. Implementable tensor methods in unconstrained convex optimization

   • Yurii Nesterov

   Full Length Paper Open access 21 November 2019 Pages: 157 - 183

6. Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems

   • Dan Garber
   • Atara Kaplan
   • Shoham Sabach

   Full Length Paper 29 November 2019 Pages: 185 - 208

   

7. Exploiting partial correlations in distributionally robust optimization

   • Divya Padmanabhan
   • Karthik Natarajan
   • Karthyek Murthy

   Full Length Paper 02 December 2019 Pages: 209 - 255

   

8. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods

   • Gabriel Haeser
   • Oliver Hinder
   • Yinyu Ye

   Full Length Paper 21 December 2019 Pages: 257 - 288

   

9. The salesman’s improved tours for fundamental classes

   • Sylvia Boyd
   • András Sebő

   Full Length Paper 09 December 2019 Pages: 289 - 307

   

10. On sparsity of the solution to a random quadratic optimization problem

    • Xin Chen
    • Boris Pittel

    Full Length Paper 09 December 2019 Pages: 309 - 336

11. Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem

    • Pascale Bendotti
    • Pierre Fouilhoux
    • Cécile Rottner

    Full Length Paper 16 December 2019 Pages: 337 - 372

    

12. Stronger MIP formulations for the Steiner forest problem

    • Daniel Schmidt
    • Bernd Zey
    • François Margot

    Full Length Paper Open access 03 January 2020 Pages: 373 - 407

    

13. An \({\mathcal {O}}(n^2 \log {n})\) algorithm for the weighted stable set problem in claw-free graphs

    • Paolo Nobili
    • Antonio Sassano

    Full Length Paper 06 January 2020 Pages: 409 - 437

    

14. Near-optimal discrete optimization for experimental design: a regret minimization approach

    • Zeyuan Allen-Zhu
    • Yuanzhi Li
    • Yining Wang

    Full Length Paper 10 January 2020 Pages: 439 - 478

    

15. Nonnegative rank depends on the field

    • Yaroslav Shitov

    Short Communication 13 November 2019 Pages: 479 - 486