1. A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices

   • Hiroshi Hirai
   • Yuni Iwamasa

   Full Length Paper 18 June 2021 Pages: 1 - 37

   

2. Bootstrap robust prescriptive analytics

   • Dimitris Bertsimas
   • Bart Van Parys

   Full Length Paper 25 June 2021 Pages: 39 - 78

   

3. Understanding the acceleration phenomenon via high-resolution differential equations

   • Bin Shi
   • Simon S. Du
   • Weijie J. Su

   Full Length Paper Open access 06 July 2021 Pages: 79 - 148

   

4. A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem

   • Hiroshi Hirai
   • Motoki Ikeda

   Full Length Paper 21 July 2021 Pages: 149 - 181

   

5. Fully polynomial time \((\Sigma ,\Pi )\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs

   • Nir Halman
   • Giacomo Nannicini

   Full Length Paper 26 July 2021 Pages: 183 - 242

   

6. Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs

   • Murat A. Erdogdu
   • Asuman Ozdaglar
   • Nuri Denizcan Vanli

   Full Length Paper 30 July 2021 Pages: 243 - 281

   

7. Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens

   • Fatma Kılınç-Karzan
   • Simge Küçükyavuz
   • Dabeen Lee

   Full Length Paper 21 July 2021 Pages: 283 - 326

   

8. An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

   • M. Paul Laiu
   • André L. Tits

   Full Length Paper 21 July 2021 Pages: 327 - 366

   

9. Empowering the configuration-IP: new PTAS results for scheduling with setup times

   • Klaus Jansen
   • Kim-Manuel Klein
   • Malin Rau

   Full Length Paper Open access 11 August 2021 Pages: 367 - 401

   

10. Integer plane multiflow maximisation: one-quarter-approximation and gaps

    • Naveen Garg
    • Nikhil Kumar
    • András Sebő

    Full Length Paper 16 August 2021 Pages: 403 - 419

    

11. On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraint

    • Haixiang Zhang
    • Andre Milzarek
    • Wotao Yin

    Full Length Paper 21 August 2021 Pages: 421 - 473

    

12. Set characterizations and convex extensions for geometric convex-hull proofs

    • Andreas Bärmann
    • Oskar Schneider

    Full Length Paper Open access 14 September 2021 Pages: 475 - 515

    

13. Worst-case analysis of clique MIPs

    • Mohammad Javad Naderi
    • Austin Buchanan
    • Jose L. Walteros

    Full Length Paper 23 September 2021 Pages: 517 - 551

    

14. Curiosities and counterexamples in smooth convex optimization

    • Jérôme Bolte
    • Edouard Pauwels

    Full Length Paper 09 October 2021 Pages: 553 - 603

    

15. A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction

    • Veronika Grimm
    • Daniel Nowak
    • Gregor Zöttl

    Full Length Paper Open access 13 December 2021 Pages: 605 - 647

    

16. Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization

    • Junyu Zhang
    • Lin Xiao

    Full Length Paper 06 October 2021 Pages: 649 - 691

    

17. Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions

    • Vivak Patel

    Full Length Paper 29 October 2021 Pages: 693 - 734

    

18. From differential equation solvers to accelerated first-order methods for convex optimization

    • Hao Luo
    • Long Chen

    Full Length Paper Open access 12 October 2021 Pages: 735 - 781

    

19. On the complexity of finding a local minimizer of a quadratic function over a polytope

    • Amir Ali Ahmadi
    • Jeffrey Zhang

    Full Length Paper 04 January 2022 Pages: 783 - 792

20. Non-convex exact community recovery in stochastic block model

    • Peng Wang
    • Zirui Zhou
    • Anthony Man-Cho So

    Full Length Paper 11 November 2021 Pages: 1 - 37

    

21. Discrete 2-convex functions

    • Satoru Fujishige
    • Fabio Tardella

    Full Length Paper 26 October 2021 Pages: 831 - 854

    

22. Best approximation mappings in Hilbert spaces

    • Heinz H. Bauschke
    • Hui Ouyang
    • Xianfu Wang

    Full Length Paper 26 October 2021 Pages: 855 - 901

    

23. A Lagrange–Newton algorithm for sparse nonlinear programming

    • Chen Zhao
    • Naihua Xiu
    • Ziyan Luo

    Full Length Paper 21 October 2021 Pages: 903 - 928

    

24. A control-theoretic perspective on optimal high-order optimization

    • Tianyi Lin
    • Michael I. Jordan

    Full Length Paper Open access 22 October 2021 Pages: 929 - 975

    

25. Decreasing minimization on M-convex sets: background and structures

    • András Frank
    • Kazuo Murota

    Full Length Paper 27 October 2021 Pages: 977 - 1025

    

26. Decreasing minimization on M-convex sets: algorithms and applications

    • András Frank
    • Kazuo Murota

    Full Length Paper 15 October 2021 Pages: 1027 - 1068

    

27. Distributionally robust stochastic programs with side information based on trimmings

    • Adrián Esteban-Pérez
    • Juan M. Morales

    Full Length Paper Open access 22 November 2021 Pages: 1069 - 1105

    

28. On linear optimization over Wasserstein balls

    • Man-Chung Yue
    • Daniel Kuhn
    • Wolfram Wiesemann

    Short Communication 17 June 2021 Pages: 1107 - 1122

29. Computing the nucleolus of weighted voting games in pseudo-polynomial time

    • Kanstantsin Pashkovich

    Short Communication 24 August 2021 Pages: 1123 - 1133

    

30. The aggregation closure is polyhedral for packing and covering integer programs

    • Kanstantsin Pashkovich
    • Laurent Poirrier
    • Haripriya Pulyassary

    Short Communication 01 November 2021 Pages: 1135 - 1147