Optimization Online is a repository of Eprints about optimization and related topics.
Submissions to Optimization Online are moderated by a team of volunteer coordinators. Coordinators check submissions for correctness of author-title-link information, but make no claim about quality or correctness of the reports.
Announce your new report by posting it on Optimization Online. Before doing so, you might want to check the classification scheme that we use to organize the site.
Subscribe to the Optimization Online monthly digest. You will receive an email message at the end of each month, with titles of and links to the reports submitted during that month.
Recent Eprints
- Random Reshuffling for Smooth Convex Optimization: Dominates Stochastic Gradient Descent
Published 2026/09/30 by Zijian Liu - On the Convergence of Column-and-Constraint Generation Algorithms in Two-Stage Robust Optimization
Published 2026/09/30 by Henri Lefebvre - Signed Budget Uncertainty for Robust Mixed-Integer Optimization
Published 2026/09/30 by Dimitris Bertsimas, Danique de Moor, Dick den Hertog, Federica Donnini - A One-Factorization Predictor–Corrector Long-Step Arc-Search Method and a Curvature-Amplified Variant for Semidefinite Programming with a Homogeneous Self-Dual Embedding
Published 2026/09/30 by Makoto Yamashita, Yaguang Yang - BDRS Can Fail for Matrix Scaling and Optimal Transport
Published 2026/09/30 by Shiqian Ma - Peppy: An AI-Assisted Workflow for Tight Convergence Analysis of Optimization Algorithms
Published 2026/09/30 by Jaewook J. Suh, TaeHo Yoon, Bicheng Ying, Shiqian Ma - Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems
Published 2026/09/30 by Khanh-Hung Giang-Tran, Soroosh Shafiee - Silver Rate Is (Almost) Optimal for Gradient Descent: The Strongly Convex Case
Published 2026/09/30 by Kaizhao Liu, Yuhan Ye - Level-Set Geometry and the Theoretical Performance of PDHG for Conic Linear Optimization
Published 2026/09/30 by Zikai Xiong, Robert M. Freund - A tight 1/3–approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem
Published 2026/09/30 by Fabio Ciccarelli, Fabio Furini