Michael J. Todd
Abstract
We give formulae for minimum volume ellipsoids that contain one-sided or two-sided cuts of a given ellipsoid. These formulae may be of use in the recent ellipsoid algorithms for convex and linear programming.
OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We give formulae for minimum volume ellipsoids that contain one-sided or two-sided cuts of a given ellipsoid. These formulae may be of use in the recent ellipsoid algorithms for convex and linear programming.
Key concepts: Ellipsoid, Ellipsoid method, Mathematics, Volume (thermodynamics), Regular polygon, Linear programming, Mathematical optimization, Convex optimization