Unified presentation of the generalized ellipsoid method

DOI10.1007/978-3-031-91357-0_16MaRDI QIDQ7297940zbMATH OpenFDO

Authors P. I. Stetsyuk, Andreas Fischer, Olha Khomiak

Publication date 15 July 2026

Full work available at URL https://doi.org/10.1007/978-3-031-91357-0_16

Mathematics Subject Classification ID

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

Cites work

• An approximate method of ellipsoids
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3830713 (Why is no real title available?)
• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 3516928 (Why is no real title available?)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Nondifferentiable optimization and polynomial problems
• On the global minimum in a balanced circular packing problem
• On the Shannon capacity of a graph
• Polynomial algorithms in linear programming
• Subgradient ellipsoid method for nonsmooth convex problems
• The ellipsoid method and computational aspects
• The generalized ellipsoid method
• The generalized ellipsoid method and its implementation
• The maximum clique problem
• Unified representation of the classical ellipsoid method

This page was built for publication: Unified presentation of the generalized ellipsoid method

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