On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

1 May 1982

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research

Vol. 7 (2), 253-261
https://doi.org/10.1287/moor.7.2.253

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.

Keywords

VOLUME ELLIPSOIDS
ELLIPSOIDS CONTAINING
MINIMUM VOLUME
GIVE
CUTS
CONVEX
SIDED
CONTAINING PART

Cited by 24 articles