1. The multiproximal linearization method for convex composite problems

   • Jérôme Bolte
   • Zheng Chen
   • Edouard Pauwels

   Full Length Paper 22 March 2019 Pages: 1 - 36

   

2. On the cost of solving augmented Lagrangian subproblems

   • Damián Fernández
   • Mikhail Solodov

   Full Length Paper 08 March 2019 Pages: 37 - 55

3. A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization

   • Aharon Ben-Tal
   • Omar El Housni
   • Vineet Goyal

   Full Length Paper 16 March 2019 Pages: 57 - 102

   

4. Goal scoring, coherent loss and applications to machine learning

   • Wenzhuo Yang
   • Melvyn Sim
   • Huan Xu

   Full Length Paper 25 March 2019 Pages: 103 - 140

   

5. Stochastic packing integer programs with few queries

   • Takanori Maehara
   • Yutaro Yamaguchi

   Full Length Paper 15 March 2019 Pages: 141 - 174

   

6. Distances to lattice points in knapsack polyhedra

   • Iskander Aliev
   • Martin Henk
   • Timm Oertel

   Full Length Paper Open access 02 April 2019 Pages: 175 - 198

7. Compact representation of near-optimal integer programming solutions

   • Thiago Serra
   • J. N. Hooker

   Full Length Paper 09 April 2019 Pages: 199 - 232

   

8. Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting

   • Ernest K. Ryu

   Full Length Paper 22 May 2019 Pages: 233 - 273

   

9. Vector coloring the categorical product of graphs

   • Chris Godsil
   • David E. Roberson
   • Antonios Varvitsiotis

   Full Length Paper 22 April 2019 Pages: 275 - 314

   

10. The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm

    • J. Cheriyan
    • J. Dippel
    • V. V. Narayan

    Full Length Paper 25 April 2019 Pages: 315 - 354

    

11. Improved approximation algorithms for hitting 3-vertex paths

    • Samuel Fiorini
    • Gwenaël Joret
    • Oliver Schaudt

    Full Length Paper 22 April 2019 Pages: 355 - 367

    

12. Sum-of-squares hierarchy lower bounds for symmetric formulations

    • Adam Kurpisz
    • Samuli Leppänen
    • Monaldo Mastrolilli

    Full Length Paper 22 May 2019 Pages: 369 - 397

13. The geometry of SDP-exactness in quadratic optimization

    • Diego Cifuentes
    • Corey Harris
    • Bernd Sturmfels

    Full Length Paper Open access 15 May 2019 Pages: 399 - 428

    

14. On the complexity of detecting convexity over a box

    • Amir Ali Ahmadi
    • Georgina Hall

    Short Communication 03 May 2019 Pages: 429 - 443

15. A filtered bucket-clustering method for projection onto the simplex and the \(\ell _1\) ball

    • Guillaume Perez
    • Michel Barlaud
    • Jean-Charles Régin

    Short Communication 15 May 2019 Pages: 445 - 464