Duality of Ellipsoidal Approximations via Semi-Infinite Programming

DOI10.1137/080717973zbMath1198.90376OpenAlexW2057210533MaRDI QIDQ3586142

Filiz Gurtuna

Publication date: 6 September 2010

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

Full work available at URL: https://semanticscholar.org/paper/2ea6ab652bba176194a53629647d6db899e3cbb5

zbMATH Keywords

dualitysemi-infinite programmingJohn ellipsoidoptimal experimental designmaximum volumeminimum volumeinscribed ellipsoidcircumscribed ellipsoid

Mathematics Subject Classification ID

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)

Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions ⋮ 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