Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
From MaRDI portal
Recommendations
- A data-independent distance to infeasibility for linear conic systems
- On infeasibility of systems of convex analytic inequalities
- A characterization of the distance to infeasibility under block-structured perturbations
- Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
Cited in
(26)- On optimal zero-preserving corrections for inconsistent linear systems
- A characterization of the distance to infeasibility under block-structured perturbations
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- The geometry of linear infeasibility
- New characterizations of Hoffman constants for systems of linear constraints
- The condition number of a function relative to a set
- Probabilistic analysis of the Grassmann condition number
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- On the block-structured distance to non-surjectivity of sublinear mappings
- Ill-posedness with respect to the solvability in linear optimization
- Feasible distance in non-conic convex optimization problems
- Extreme points of well-posed polytopes
- A condition-based algorithm for solving polyhedral feasibility problems
- The radius of metric regularity
- A data-independent distance to infeasibility for linear conic systems
- Computation of condition numbers for linear programming problems using Peña’s method
- Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity
- K-best feasible clusters - ranking optimal solutions from an infeasible LP
- Smoothed analysis of condition numbers and complexity implications for linear programming
- Conic systems and sublinear mappings: equivalent approaches.
- Structured distance to non-surjectivity of convex processes and its applications to robust controllability under structured perturbations
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- A primal-dual symmetric relaxation for homogeneous conic systems
- On regularity of convex multifunctions
This page was built for publication: Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943942)
