Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
From MaRDI portal
Publication:1961978
DOI10.1007/s101070050088zbMath0966.90048OpenAlexW4233639580MaRDI QIDQ1961978
Jorge R. Vera, Robert M. Freund
Publication date: 3 April 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050088
conditioninginterior-point methodsinfinite programmingcomplexity of linear programmingconic linear systems
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)
Related Items (27)
Non-parametric tests of productive efficiency with errors-in-variables ⋮ Extreme points of well-posed polytopes ⋮ On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate ⋮ Sufficient conditions for total ill-posedness in linear semi-infinite optimization ⋮ Stability in linear optimization and related topics. A personal tour ⋮ Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming ⋮ A numerical algorithm for zero counting. III: Randomization and condition ⋮ Conditioning of linear-quadratic two-stage stochastic optimization problems ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ A simple polynomial-time rescaling algorithm for solving linear programs ⋮ Probabilistic analysis of condition numbers for linear programming ⋮ Improved complexity results on solving real-number linear feasibility problems ⋮ On the behavior of the homogeneous self-dual model for conic convex optimization ⋮ Solving linear programs with finite precision. II: Algorithms ⋮ Ill-posedness with respect to the solvability in linear optimization ⋮ Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity ⋮ A geometric analysis of Renegar's condition number, and its interplay with conic curvature ⋮ Towards a deeper geometric, analytic and algorithmic understanding of margins ⋮ Computation of condition numbers for linear programming problems using Peña’s method ⋮ On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming ⋮ On infeasibility of systems of convex analytic inequalities ⋮ Probabilistic analysis of the Grassmann condition number ⋮ The radius of metric regularity
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
