Representability of convex sets by analytical linear inequality systems.
From MaRDI portal
(Redirected from Publication:1428616)
Recommendations
Cites work
- A purification algorithm for semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- Analytical linear inequality systems and optimization
- Conjugacy for closed convex sets
- Faces and duality in convex cones
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- scientific article; zbMATH DE number 3238144 (Why is no real title available?)
- scientific article; zbMATH DE number 3320209 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Locally Farkas-Minkowski linear inequality systems
- Locally polyhedral linear inequality systems
- Quasipolyhedral sets in linear semiinfinite inequality systems
- Some characterizations of convex polyhedra
- Theory of cones
Cited in
(8)- On linear inequality systems with smooth coefficients
- Selected applications of linear semi-infinite systems theory
- Local conicity and polyhedrality of convex sets
- Voronoi cells via linear inequality systems
- Quasi-polyhedral convex bodies in locally convex spaces
- Separating the solution sets of analytical and polynomial systems
- Motzkin decomposition of closed convex sets
- Cyclic convex bodies and optimization moment problems
This page was built for publication: Representability of convex sets by analytical linear inequality systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428616)