The ellipsoid method and computational aspects

DOI10.23952/COT.2023.21MaRDI QIDQ7009040zbMATH OpenFDO

Authors Andreas Fischer, Olga Khomyak, P. I. Stetsyuk

Publication date 20 March 2025

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

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

zbMATH Keywords

ellipsoid methodnonsmooth optimizationsaddle point problemspace dilationsubgradient algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Cites work

• r-algorithms and ellipsoids
• A penalty approach to linear programs with many two-sided constraints
• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Nondifferentiable optimization and polynomial problems
• Polynomial algorithms in linear programming
• The generalized ellipsoid method
• The generalized ellipsoid method and its implementation

This page was built for publication: The ellipsoid method and computational aspects

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