Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system

Recommendations

The Structured Distance to Ill-Posedness for Conic Systems
A data-independent distance to infeasibility for linear conic systems
Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems

Cited in

(37)

Probabilistic analysis of the Grassmann condition number
A simple polynomial-time rescaling algorithm for solving linear programs
Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
Conic systems and sublinear mappings: equivalent approaches.
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
Non-parametric tests of productive efficiency with errors-in-variables
Ill-conditioned inclusions
On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems
A numerical algorithm for zero counting. III: Randomization and condition
The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
The radius of metric regularity
Distance to Solvability/Unsolvability in Linear Optimization
Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity
New characterizations of Hoffman constants for systems of linear constraints
A geometric analysis of Renegar's condition number, and its interplay with conic curvature
Extreme points of well-posed polytopes
Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
Probabilistic analysis of condition numbers for linear programming
Sufficient conditions for total ill-posedness in linear semi-infinite optimization
Computation of condition numbers for linear programming problems using Peña’s method
Feasibility problems via paramonotone operators in a convex setting
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
A data-independent distance to infeasibility for linear conic systems
On infeasibility of systems of convex analytic inequalities
Towards a deeper geometric, analytic and algorithmic understanding of margins
On strata of degenerate polyhedral cones. I: Condition and distance to strata
On the Turing model complexity of interior point methods for semidefinite programming
On the behavior of the homogeneous self-dual model for conic convex optimization
Conditioning of linear-quadratic two-stage stochastic optimization problems
Stability in linear optimization and related topics. A personal tour
Ill-posedness with respect to the solvability in linear optimization
Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming
The Structured Distance to Ill-Posedness for Conic Systems
Solving linear programs with finite precision. II: Algorithms
Improved complexity results on solving real-number linear feasibility problems

This page was built for publication: Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961978)