- Dorothee Henke. The Robust Bilevel Selection Problem. Open J. Math. Optim., 6:1-35, 2025.
- Guillaume Wang, Lénaïc Chizat. An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games. Open J. Math. Optim., 6:1-66, 2025.
- Axel Flinth, Frédéric de Gournay, Pierre Weiss. Grid is Good. Adaptive Refinement Algorithms for Off-the-Grid Total Variation Minimization. Open J. Math. Optim., 6:1-27, 2025.
- Marc Goerigk, Jannis Kurtz, Martin Schmidt 0003, Johannes Thürauf. Connections between Robust and Bilevel Optimization. Open J. Math. Optim., 6:1-17, 2025.
- Serge Gratton, Sadok Jerad, Philippe L. Toint. A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity. Open J. Math. Optim., 6:1-24, 2025.
- Baptiste Goujaud, Adrien B. Taylor, Aymeric Dieuleveut. Short Paper - Quadratic minimization: from conjugate gradient to an adaptive Polyak's momentum method with Polyak step-sizes. Open J. Math. Optim., 5:1-10, 2024.
- Zhenan Fan, Huang Fang, Michael P. Friedlander. Cardinality-constrained structured data-fitting problems. Open J. Math. Optim., 5:1-21, 2024.
- Jérémy Omer, Michael Poss, Maxime Rougier. Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty. Open J. Math. Optim., 5:1-25, 2024.
- Nicholas J. A. Harvey, Chris Liaw, Sikander Randhawa. Tight analyses for subgradient descent I: Lower bounds. Open J. Math. Optim., 5:1-17, 2024.
- Matthias Walter. Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions. Open J. Math. Optim., 5:1-12, 2024.