An improved ellipsoid method for solving convex differentiable optimization problems

DOI10.1016/j.orl.2012.09.005zbMath1258.90056OpenAlexW2114348069MaRDI QIDQ1939709

Shoham Sabach, Amir Beck

Publication date: 5 March 2013

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.09.005

zbMATH Keywords

convex optimizationellipsoid methodLipschitz gradient

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Cites Work

• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• Introductory lectures on convex optimization. A basic course.
• An ellipsoid algorithm for nonlinear programming
• Feature Article—The Ellipsoid Method: A Survey
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved ellipsoid method for solving convex differentiable optimization problems