Improved Complexity for Maximum Volume Inscribed Ellipsoids

DOI10.1137/S1052623401390902zbMath1026.90067MaRDI QIDQ4785883

Kurt M. Anstreicher

Publication date: 5 January 2003

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

maximum volume inscribed ellipsoidinscribed ellipsoid method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Convex programming (90C25)

Related Items (2)

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Minimum-volume enclosing ellipsoids and core sets

Uses Software

• MVE

This page was built for publication: Improved Complexity for Maximum Volume Inscribed Ellipsoids