Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
DOI10.1080/10556788.2011.626037zbMath1279.90174OpenAlexW2131728408MaRDI QIDQ5200559
Publication date: 6 November 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.626037
automorphism groupoptimality conditionssemi-infinite programmingHaar measuresymmetric convex bodiescontact pointsLöwner ellipsoidJohn ellipsoidminimum-volume ellipsoidinscribed ellipsoidcircumscribed ellipsoidmaximum-volume ellipsoid
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Transformation groups and semigroups (topological aspects) (54H15) Geometry and structure of normed linear spaces (46B20) Semi-infinite programming (90C34) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Compact groups (22C05) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (3)
Cites Work
- Convexity properties of the cone of nonnegative polynomials
- Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
- Minimal ellipsoids and their duals
- On Khachian's algorithm and minimal ellipsoids
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Contact points of convex bodies
- Convexity of quadratic transformations and its use in control and optimization
- Über die kleinste umbeschriebene und die grösste einbeschriebene Ellipse eines konvexen Bereichs
- Duality of Ellipsoidal Approximations via Semi-Infinite Programming
- Family of algorithms for solving convex programming problems
- Feature Article—The Ellipsoid Method: A Survey
- Optimal design: Some geometrical aspects of D-optimality
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
- Some results on centers of polytopes
- Computation of Minimum-Volume Covering Ellipsoids
- Fixing systems and inner illumination
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- A Survey of the S-Lemma
This page was built for publication: Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies