Duality of ellipsoidal approximations via semi-infinite programming
optimal experimental designdualitysemi-infinite programmingJohn ellipsoidmaximum volumeminimum volumeinscribed ellipsoidcircumscribed ellipsoid
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Compact groups (22C05) Nonlinear programming (90C30) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Geometry and structure of normed linear spaces (46B20) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Semi-infinite programming (90C34) Transformation groups and semigroups (topological aspects) (54H15)
- Minimum-volume ellipsoids. Theory and algorithms
- scientific article; zbMATH DE number 926786
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Embedded maximal ellipsoids and semi-infinite optimization
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Embedded maximal ellipsoids and semi-infinite optimization
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- Comparative study of RPSALG algorithm for convex semi-infinite programming
This page was built for publication: Duality of ellipsoidal approximations via semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586142)
