Representability of convex sets by analytical linear inequality systems.

DOI10.1016/j.laa.2003.09.018zbMath1053.52003OpenAlexW2000414951MaRDI QIDQ1428616

Rubén Puente, Daniel A. Jaume

Publication date: 29 March 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.09.018

zbMATH Keywords

quasipolyhedral setsclosed convex setssmooth convex bodiesanalytical linear inequality systemsconjugate faces

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Semi-infinite programming (90C34) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (7)

Separating the solution sets of analytical and polynomial systems ⋮ Motzkin decomposition of closed convex sets ⋮ Local conicity and polyhedrality of convex sets ⋮ Voronoi cells via linear inequality systems ⋮ On linear inequality systems with smooth coefficients ⋮ Selected applications of linear semi-infinite systems theory ⋮ Cyclic convex bodies and optimization moment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasipolyhedral sets in linear semiinfinite inequality systems
• Some characterizations of convex polyhedra
• Theory of cones
• A purification algorithm for semi-infinite programming
• Locally Farkas-Minkowski linear inequality systems
• Locally polyhedral linear inequality systems
• Conjugacy for closed convex sets
• An extension of the simplex algorithm for semi-infinite linear programming
• Analytical linear inequality systems and optimization
• Faces and duality in convex cones

This page was built for publication: Representability of convex sets by analytical linear inequality systems.