A Data-Independent Distance to Infeasibility for Linear Conic Systems
From MaRDI portal
Publication:4959838
DOI10.1137/18M1189464zbMath1437.90120arXiv1805.09494OpenAlexW3014219249MaRDI QIDQ4959838
Vera Roshchina, Javier F. Peña
Publication date: 7 April 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.09494
Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Related Items
Cites Work
- The gap between the null space property and the restricted isometry property
- A geometrical stability condition for compressed sensing
- Critical objective size and calmness modulus in linear programming
- A polynomial projection algorithm for linear feasibility problems
- On general minimax theorems
- Convex analysis and nonlinear optimization. Theory and examples.
- On strata of degenerate polyhedral cones. II: Relations between condition measures
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Condition measures and properties of the central trajectory of a linear program
- It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
- Some perturbation theory for linear programming
- Complexity of convex optimization using geometry-based measures and a reference point
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- A simplified view of first order methods for optimization
- Solving conic systems via projection and rescaling
- On condition number theorems in mathematical programming
- An extension of Chubanov's algorithm to symmetric cones
- Linear programming, complexity theory and elementary functional analysis
- The convex geometry of linear inverse problems
- On the symmetry function of a convex set
- A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
- An Efficient Rescaled Perceptron Algorithm for Conic Systems
- A Condition Number for Multifold Conic Systems
- The Relaxation Method for Solving Systems of Linear Inequalities
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- The radius of metric regularity
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- A Coordinate-Free Condition Number for Convex Programming
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing
- Living on the edge: phase transitions in convex programs with random data
- Stable signal recovery from incomplete and inaccurate measurements
- Foundations of Optimization
- A simple polynomial-time rescaling algorithm for solving linear programs
- A new condition number for linear programming
