1. Complexity of packing common bases in matroids

   • Kristóf Bérczi
   • Tamás Schwarcz

   Full Length Paper Open access 08 April 2020 Pages: 1 - 18

   

2. Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning

   • Jérôme Bolte
   • Edouard Pauwels

   Full Length Paper 15 April 2020 Pages: 19 - 51

   

3. Separation routine and extended formulations for the stable set problem in claw-free graphs

   • Yuri Faenza
   • Gianpaolo Oriolo
   • Gautier Stauffer

   Full Length Paper 28 April 2020 Pages: 53 - 84

   

4. Adaptive regularization with cubics on manifolds

   • Naman Agarwal
   • Nicolas Boumal
   • Coralia Cartis

   Full Length Paper 13 May 2020 Pages: 85 - 134

   

5. Stochastic quasi-gradient methods: variance reduction via Jacobian sketching

   • Robert M. Gower
   • Peter Richtárik
   • Francis Bach

   Full Length Paper Open access 12 May 2020 Pages: 135 - 192

   

6. Strong formulations for conic quadratic optimization with indicator variables

   • Andrés Gómez

   Full Length Paper 30 April 2020 Pages: 193 - 226

   

7. Simple bilevel programming and extensions

   • Stephan Dempe
   • Nguyen Dinh
   • Tanushree Pandit

   Full Length Paper 25 April 2020 Pages: 227 - 253

   

8. The condition number of a function relative to a set

   • David H. Gutman
   • Javier F. Peña

   Full Length Paper 06 May 2020 Pages: 255 - 294

   

9. Maximum edge-disjoint paths in planar graphs with congestion 2

   • Loïc Séguin-Charbonneau
   • F. Bruce Shepherd

   Full Length Paper 20 May 2020 Pages: 295 - 317

   

10. Box-total dual integrality, box-integrality, and equimodular matrices

    • Patrick Chervet
    • Roland Grappe
    • Louis-Hadrien Robert

    Full Length Paper 20 May 2020 Pages: 319 - 349

    

11. Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion

    • Richard Y. Zhang
    • Javad Lavaei

    Full Length Paper 25 May 2020 Pages: 351 - 393

    

12. Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling

    • Deeparnab Chakrabarty
    • Sanjeev Khanna

    Short Communication 15 April 2020 Pages: 395 - 407

    

13. Correction to: Stronger MIP formulations for the Steiner forest problem

    • Daniel Schmidt
    • Bernd Zey
    • François Margot

    Correction Open access 04 May 2021 Pages: 409 - 410