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
- Symmetry-dependence in Rounding of a Convex Body
Published 2026/08/31 by Zikai Xiong, Robert M. Freund - Radial-type error bounds for semidefinite feasibility problems without strict feasibility: qualitative estimates and asymptotic tightness
Published 2026/08/31 by Mitsuhiro Nishijima, Guoyin Li, Bruno F. Lourenço - UGM: A Unified Framework and New Perspectives for Accelerated Gradient Methods in Smooth and Strongly Convex Optimization
Published 2026/08/31 by Danqing Zhou, Shiqian Ma, Junfeng Yang - Classification of facial exposedness of completely positive cones over symmetric cones
Published 2026/08/31 by Mitsuhiro Nishijima - New inexact adaptive proximal gradient algorithms for nonconvex composite optimization problems
Published 2026/08/31 by Pham Thi Hoai - Integrated Master Planning and Demand Fulfillment in Multi-Echelon Supply Chains: Partial vs. All-or-Nothing Fulfillment
Published 2026/08/29 by Felix P. Broesamle, Hannah Bakker, Stefan Nickel - Variable Selection for Feature-Based Newsvendor
Published 2026/08/29 by Jie Wang - The subtle behavior of the facial distance
Published 2026/08/28 by Javier F. Peña - An Asymptotic Framework for the Integrality Gap of the Traveling Salesman Problem
Published 2026/08/28 by Janos Barta, Monaldo Mastrolilli, Eleonora Vercesi, Tullio Villa - The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+8 Non-Zero Components
Published 2026/08/28 by Tullio Villa, Eleonora Vercesi, Janos Barta, Monaldo Mastrolilli