On Numerical Solution of the Maximum Volume Ellipsoid Problem

DOI10.1137/S1052623401397230zbMath1043.90069OpenAlexW2004189075MaRDI QIDQ4441948

Liyan Gao, Yin Zhang

Publication date: 19 January 2004

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

Full work available at URL: https://doi.org/10.1137/s1052623401397230

zbMATH Keywords

primal-dual interior-point algorithmsmaximum volume ellipsoid problem

Mathematics Subject Classification ID

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

Related Items (12)

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Clustering via minimum volume ellipsoids ⋮ On KKT points of Celis-Dennis-Tapia subproblem ⋮ Globally convergent evolution strategies for constrained optimization ⋮ Robust constrained control of piecewise affine systems through set‐based reachability computations ⋮ Optimal move blocking strategies for model predictive control ⋮ Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities ⋮ Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies ⋮ Conditional minimum volume ellipsoid with application to multiclass discrimination ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system ⋮ MVE ⋮ Minimum-volume enclosing ellipsoids and core sets

This page was built for publication: On Numerical Solution of the Maximum Volume Ellipsoid Problem