The ellipsoid method redux

DOI10.23952/COT.2024.17MaRDI QIDQ7021296zbMATH OpenFDO

Authors Michael J. Todd

Publication date 28 February 2025

Published in Communications in Optimization Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/COT.2024.17

zbMATH Keywords

certificatesellipsoid methodlinear inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites work

• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• Family of algorithms for solving convex programming problems
• Feature Article—The Ellipsoid Method: A Survey
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 4123531 (Why is no real title available?)
• scientific article; zbMATH DE number 3248677 (Why is no real title available?)
• Location of the Maximum on Unimodal Surfaces
• On Linear Characterizations of Combinatorial Optimization Problems
• On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
• Optimization methods adapting to the problem of significant dimension
• Subgradient ellipsoid method for nonsmooth convex problems
• The ellipsoid method and its consequences in combinatorial optimization
• The Evolution of Methods of Convex Optimization
• The Speed of Shor's R-algorithm

This page was built for publication: The ellipsoid method redux

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