- Andreas Fischer 0004, Alexey F. Izmailov, Mikhail V. Solodov. Unit stepsize for the Newton method close to critical solutions. Math. Program., 187(1):697-721, 2021.
- Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford. Lower bounds for finding stationary points II: first-order methods. Math. Program., 185(1-2):315-355, 2021.
- Matthias Köppe, Yuan Zhou 0002. Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem. Math. Program., 187(1):195-252, 2021.
- Danial Davarnia, Willem Jan van Hoeve. Outer approximation for integer nonlinear programs via decision diagrams. Math. Program., 187(1):111-150, 2021.
- Serge Gratton, Ehouarn Simon, Philippe L. Toint. An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program., 187(1):1-24, 2021.
- Bin Hu 0002, Peter J. Seiler, Laurent Lessard. Analysis of biased stochastic gradient descent using sequential semidefinite programs. Math. Program., 187(1):383-408, 2021.
- Mert Gürbüzbalaban, Asuman E. Ozdaglar, Pablo A. Parrilo. Why random reshuffling beats stochastic gradient descent. Math. Program., 186(1):49-84, 2021.
- Daniel R. Schmidt, Bernd Zey, François Margot. Stronger MIP formulations for the Steiner forest problem. Math. Program., 186(1):373-407, 2021.
- Vincent Guigues. Inexact stochastic mirror descent for two-stage nonlinear stochastic programs. Math. Program., 187(1):533-577, 2021.
- Gabriel Haeser, Oliver Hinder, Yinyu Ye. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Math. Program., 186(1):257-288, 2021.