- Dirk Banholzer, Jörg Fliege, Ralf Werner. A radial basis function method for noisy global optimisation. Math. Program., 211(1):49-92, May 2025.
- Wenbao Ai, Wei Liang, JianHua Yuan. On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints. Math. Program., 211(1):5-48, May 2025.
- Luze Xu, Jon Lee 0001. Gaining or losing perspective for convex multivariate functions on box domains. Math. Program., 211(1):319-339, May 2025.
- Buse Sen, Deniz Akkaya, Mustafa Ç. Pinar. Sparsity penalized mean-variance portfolio selection: analysis and computation. Math. Program., 211(1):281-318, May 2025.
- Tobias Harks, Julian Schwarz. Generalized Nash equilibrium problems with mixed-integer variables. Math. Program., 209(1):231-277, January 2025.
- Manu Upadhyaya, Sebastian Banert, Adrien B. Taylor, Pontus Giselsson. Automated tight Lyapunov analysis for first-order methods. Math. Program., 209(1):133-170, January 2025.
- Simone Garatti, Marco C. Campi. Non-convex scenario optimization. Math. Program., 209(1):557-608, January 2025.
- Milan Korda, Victor Magron, Rodolfo Rios-Zertuche. Convergence rates for sums-of-squares hierarchies with correlative sparsity. Math. Program., 209(1):435-473, January 2025.
- Yusuke Kobayashi 0001. Optimal general factor problem and jump system intersection. Math. Program., 210(1):591-610, March 2025.
- Francis Bach. Sum-of-squares relaxations for polynomial min-max problems over simple sets. Math. Program., 209(1):475-501, January 2025.