Locally polyhedral linear inequality systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3238144 (Why is no real title available?)
- A theory of linear inequality systems
- An extension of the simplex algorithm for semi-infinite linear programming
- Convex Analysis
- Extremal structure of convex sets
- Farkas-Minkowski systems in semi-infinite programming
- Quasipolyhedral sets in linear semiinfinite inequality systems
- Some characterizations of convex polyhedra
Cited in
(16)- Directional end of a convex set: theory and applications.
- Linear representations and quasipolyhedrality of a finite-valued convex function
- Representability of convex sets by analytical linear inequality systems.
- On local coincidence of a convex set and its tangent cone
- Analytical linear inequality systems and optimization
- Selected applications of linear semi-infinite systems theory
- Linear semi-infinite programming theory: an updated survey
- Locally Farkas-Minkowski linear inequality systems
- Weaker conditions for subdifferential calculus of convex functions
- Boundedly polyhedral sets and \(F\)-simplices
- Saturation in linear optimization
- Calmness of partially perturbed linear systems with an application to the central path
- Voronoi cells via linear inequality systems
- On error bound moduli for locally Lipschitz and regular functions
- Local conicity and polyhedrality of convex sets
- From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems
This page was built for publication: Locally polyhedral linear inequality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377509)
