Convergence Rates of the Ellipsoid Method on General Convex Functions

DOI10.1287/MOOR.8.1.135MaRDI QIDQ4744071zbMATH OpenOpenAlexFDO

Authors Jean-Louis Goffin

Publication date 1983

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.8.1.135

zbMATH Keywords

ellipsoid methodgeometric convergence ratenondifferentiable optimizationunconstrained minimization of a general convex function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cited in

(7)

• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• Solving nonlinear principal-agent problems using bilevel programming
• General models in min-max continuous location: Theory and solution techniques
• An objective-function ellipsoid-algorithm for convex quadraical programming
• A direct ellipsoid method for linear programming
• An ellipsoid algorithm for equality-constrained nonlinear programs
• A subgradient supported ellipsoid method for convex multiobjective optimization problems

This page was built for publication: Convergence Rates of the Ellipsoid Method on General Convex Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744071)