On Khachian's algorithm and minimal ellipsoids

DOI10.1007/BF01396759zbMath0437.90055MaRDI QIDQ1141586

Diethard Pallaschke, Hermann Koenig

Publication date: 1981

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132698

zbMATH Keywords

ellipsoidslinear inequalitiesbisection procedureparallel hyperplanesKhachian's algorithmminimal ellipsoidsnumerical improvements

Mathematics Subject Classification ID

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

Related Items (6)

An objective-function ellipsoid-algorithm for convex quadraical programming ⋮ Method of simple-body centroids ⋮ Minimal ellipsoids and their duals ⋮ Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming ⋮ Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies ⋮ The ellipsoid method and its implications

This page was built for publication: On Khachian's algorithm and minimal ellipsoids