- 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 Parmentier. Learning structured approximations of combinatorial optimization problems. Open J. Math. Optim., 6:1-27, 2025.
- Terunari Fuji, Pierre-Louis Poirion, Akiko Takeda. Theoretical analysis of the randomized subspace regularized Newton method for non-convex optimization. Open J. Math. Optim., 6:1-35, 2025.
- Manuel Berkemeier, Sebastian Peitz. Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients. Open J. Math. Optim., 6:1-36, 2025.
- Gabriel Ponte, Marcia Fampa, Jon Lee 0001, Luze Xu. Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses. Open J. Math. Optim., 6:1-24, 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.
- Rodrigo Maulen-Soto, Jalal Fadili, Hédy Attouch. Stochastic Differential Inclusions and Tikhonov Regularization for Stochastic Non-Smooth Convex Optimization in Hilbert spaces. Open J. Math. Optim., 6:1-30, 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.