1. Arboricity games: the core and the nucleolus

   • Han Xiao
   • Qizhi Fang

   Full Length Paper Open access 29 January 2022 Pages: 1 - 25

   

2. Approximation algorithms for the generalized incremental knapsack problem

   • Yuri Faenza
   • Danny Segev
   • Lingyi Zhang

   Full Length Paper 30 January 2022 Pages: 27 - 83

3. Error bounds and a condition number for the absolute value equations

   • Moslem Zamani
   • Milan Hladík

   Full Length Paper Open access 30 January 2022 Pages: 85 - 113

4. Affine-invariant contracting-point methods for Convex Optimization

   • Nikita Doikov
   • Yurii Nesterov

   Full Length Paper Open access 10 January 2022 Pages: 115 - 137

   

5. Sparse PCA on fixed-rank matrices

   • Alberto Del Pia

   Full Length Paper 19 January 2022 Pages: 139 - 157

   

6. Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality

   • R. Tyrrell Rockafellar

   Full Length Paper 19 January 2022 Pages: 159 - 194

   

7. Convergence rates of the Heavy-Ball method under the Łojasiewicz property

   • J.-F. Aujol
   • Ch. Dossal
   • A. Rondepierre

   Full Length Paper 21 January 2022 Pages: 195 - 254

   

8. Generalized self-concordant analysis of Frank–Wolfe algorithms

   • Pavel Dvurechensky
   • Kamil Safin
   • Mathias Staudigl

   Full Length Paper Open access 29 January 2022 Pages: 255 - 323

   

9. Nonlinear acceleration of momentum and primal-dual algorithms

   • Raghu Bollapragada
   • Damien Scieur
   • Alexandre d’Aspremont

   Full Length Paper 09 February 2022 Pages: 325 - 362

   

10. Near-linear convergence of the Random Osborne algorithm for Matrix Balancing

    • Jason M. Altschuler
    • Pablo A. Parrilo

    Full Length Paper Open access 30 May 2022 Pages: 363 - 397

    

11. Terracini convexity

    • James Saunderson
    • Venkat Chandrasekaran

    Full Length Paper Open access 05 March 2022 Pages: 399 - 441

    

12. Perturbed Fenchel duality and first-order methods

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

    Full Length Paper 03 February 2022 Pages: 443 - 469

    

13. Sublinear circuits and the constrained signomial nonnegativity problem

    • Riley Murray
    • Helen Naumann
    • Thorsten Theobald

    Full Length Paper Open access 09 February 2022 Pages: 471 - 505

14. Achieving consistency with cutting planes

    • Danial Davarnia
    • Atefeh Rajabalizadeh
    • John Hooker

    Full Length Paper 21 February 2022 Pages: 507 - 537

    

15. Lower bounds on the size of general branch-and-bound trees

    • Santanu S. Dey
    • Yatharth Dubey
    • Marco Molinaro

    Full Length Paper 09 February 2022 Pages: 539 - 559

    

16. On the optimality of pseudo-polynomial algorithms for integer programming

    • Fedor V. Fomin
    • Fahad Panolan
    • Saket Saurabh

    Full Length Paper 14 February 2022 Pages: 561 - 593

    

17. Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours

    • Arash Haddadan
    • Alantha Newman

    Full Length Paper 21 March 2022 Pages: 595 - 620

    

18. Chance-constrained set covering with Wasserstein ambiguity

    • Haoming Shen
    • Ruiwei Jiang

    Full Length Paper 21 March 2022 Pages: 621 - 674

    

19. Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates

    • Kwassi Joseph Dzahini
    • Michael Kokkolaras
    • Sébastien Le Digabel

    Full Length Paper 30 March 2022 Pages: 675 - 732

    

20. On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones

    • Dogyoon Song
    • Pablo A. Parrilo

    Full Length Paper 01 April 2022 Pages: 733 - 785

    

21. Complexity of branch-and-bound and cutting planes in mixed-integer optimization

    • Amitabh Basu
    • Michele Conforti
    • Hongyi Jiang

    Full Length Paper 07 March 2022 Pages: 787 - 810

    

22. A duality based 2-approximation algorithm for maximum agreement forest

    • Neil Olver
    • Frans Schalekamp
    • Anke van Zuylen

    Full Length Paper Open access 21 March 2022 Pages: 811 - 853

    

23. An exact penalty approach for optimization with nonnegative orthogonality constraints

    • Bo Jiang
    • Xiang Meng
    • Xiaojun Chen

    Full Length Paper 25 March 2022 Pages: 855 - 897

    

24. A globally convergent proximal Newton-type method in nonsmooth convex optimization

    • Boris S. Mordukhovich
    • Xiaoming Yuan
    • Jin Zhang

    Full Length Paper 22 March 2022 Pages: 899 - 936

    

25. Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry

    • Guillaume Garrigos
    • Lorenzo Rosasco
    • Silvia Villa

    Full Length Paper 21 June 2022 Pages: 937 - 996

    

26. Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings

    • Coralia Cartis
    • Estelle Massart
    • Adilet Otemissov

    Full Length Paper Open access 14 May 2022 Pages: 997 - 1058

    

27. Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes

    • Guanghui Lan

    Full Length Paper 28 April 2022 Pages: 1059 - 1106

    

28. On implicit function theorem for locally Lipschitz equations

    • Aram V. Arutyunov
    • Sergey E. Zhukovskiy

    Short Communication 05 January 2022 Pages: 1107 - 1120