Locally polyhedral linear inequality systems
From MaRDI portal
Publication:1377509
DOI10.1016/S0024-3795(97)00241-3zbMath0892.15013MaRDI QIDQ1377509
Marco A. López, Edward J. Anderson, Miguel Angel Goberna
Publication date: 26 January 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ Local conicity and polyhedrality of convex sets ⋮ Linear representations and quasipolyhedrality of a finite-valued convex function ⋮ Voronoi cells via linear inequality systems ⋮ Saturation in linear optimization ⋮ Representability of convex sets by analytical linear inequality systems. ⋮ Analytical linear inequality systems and optimization ⋮ Calmness of partially perturbed linear systems with an application to the central path ⋮ On local coincidence of a convex set and its tangent cone ⋮ Selected applications of linear semi-infinite systems theory ⋮ Unnamed Item ⋮ On error bound moduli for locally Lipschitz and regular functions ⋮ Linear semi-infinite programming theory: an updated survey ⋮ Locally Farkas-Minkowski linear inequality systems ⋮ Directional end of a convex set: theory and applications.
Cites Work
- Unnamed Item
- Quasipolyhedral sets in linear semiinfinite inequality systems
- Extremal structure of convex sets
- Some characterizations of convex polyhedra
- A theory of linear inequality systems
- Farkas-Minkowski systems in semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- Convex Analysis
This page was built for publication: Locally polyhedral linear inequality systems