Some results about the facial geometry of convex semi-infinite systems

DOI10.1080/02331930600816080zbMATH Open1134.90509OpenAlexW1989104718MaRDI QIDQ3426239FDOQ3426239

Authors María D. Fajardo, Marco Antonio López Cerdá

Publication date 8 March 2007

Published in Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10045/8361

zbMATH Keywords

constraint qualificationsSlater conditionfacial structure of the feasible setsemi-infinite convex inequalities systems

Mathematics Subject Classification ID

Convex programming (90C25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Convex functions and convex programs in convex geometry (52A41) Semi-infinite programming (90C34)

Recommendations

• Some geometric properties of a strongly facially symmetric space
• Some results on infinite-dimensional convexity
• Finite dimensional convex structures. II: The invariants
• Generalised convex geometries with applications to systems of subsemilattices
• scientific article; zbMATH DE number 4210949
• Geometric analysis aspects of infinite semiplanar graphs with nonnegative curvature. II
• Geometric analysis aspects of infinite semiplanar graphs with nonnegative curvature
• Facial structure of matrix convex sets
• Convexity theorems for semisimple symmetric spaces
• Convex functions on symmetric spaces, side lengths of polygons and the stability inequalities for weighted configurations at infinity

Cites work

• Constraint qualifications for semi-infinite systems of convex inequalities
• Dimension and finite reduction in linear semi-infinite programming
• Locally Farkas-Minkowski linear inequality systems
• Locally Farkas-Minkowski systems in convex semi-infinite programming

Cited in

(7)

• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
• Recent contributions to linear semi-infinite optimization: an update
• Selected applications of linear semi-infinite systems theory
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• Optimality criteria without constraint qualifications for linear semidefinite problems
• Recent contributions to linear semi-infinite optimization
• Implicit optimality criterion for convex SIP problem with box constrained index set

This page was built for publication: Some results about the facial geometry of convex semi-infinite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426239)