Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity
DOI10.1080/02331930600815926zbMath1129.65028OpenAlexW2004954652MaRDI QIDQ5758204
F. J. Gómez-Senent, Maria J. Cánovas, Juan Parra
Publication date: 3 September 2007
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930600815926
stabilitylinear programmingill-posednesssystems of linear equationssystems of linear inequalitiesdistance to infeasibilitylinear constraint system
Ill-posedness and regularization problems in numerical linear algebra (65F22) Linear programming (90C05) Set-valued and variational analysis (49J53) Linear inequalities of matrices (15A39) Semi-infinite programming (90C34)
Related Items (5)
Cites Work
- Unnamed Item
- Metric regularity of the feasible set mapping in semi-infinite optimization
- Some perturbation theory for linear programming
- Semi-infinite optimization: Structure and stability of the feasible set
- Linear programming, complexity theory and elementary functional analysis
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- On the stability of linear systems with an exact constraint set
- Coderivative analysis of variational systems
- Metric regularity of semi-infinite constraint systems
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Unifying Condition Numbers for Linear Programming
- A characterization of ill-posed data instances for convex programming.
This page was built for publication: Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity