- Jérôme Bolte, Quoc-Tung Le, Edouard Pauwels, Samuel Vaiter. Geometric and computational hardness of bilevel programming. Math. Program., 215(1):539-574, January 2026.
- Michael Muehlebach, Michael I. Jordan. Accelerated first-order optimization under nonlinear constraints. Math. Program., 215(1):407-452, January 2026.
- Coralia Cartis, Wenqi Zhu. Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. Math. Program., 215(1):669-715, January 2026.
- Liang Chen 0006, Ruoning Chen, Defeng Sun, Liping Zhang 0008. Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming. Math. Program., 215(1):637-668, January 2026.
- Andrew D. McRae. Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms. Math. Program., 215(1):717-741, January 2026.
- Kun Huang, Shi Pu 0004, Angelia Nedic. Correction: An accelerated distributed stochastic gradient method with momentum. Math. Program., 215(1):859-861, January 2026.
- Haihao Lu, Jinwen Yang. A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming. Math. Program., 215(1):771-808, January 2026.
- Guillermo Gallego 0001, Danny Segev. A prophet inequality based approach to the adaptive ProbeTop$\varvec{K}$ problem. Math. Program., 215(1):57-93, January 2026.
- Jiawang Nie, Zheng Qu 0001, Xindong Tang, Linghao Zhang. A characterization for tightness of the sparse Moment-SOS hierarchy. Math. Program., 215(1):369-405, January 2026.
- Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert. Polyhedral Newton-min algorithms for complementarity problems. Math. Program., 215(1):269-324, January 2026.