Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
From MaRDI portal
Publication:4943942
DOI10.1137/S1052623497323674zbMath0957.15005OpenAlexW1988971579MaRDI QIDQ4943942
Publication date: 19 March 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497323674
convex programmingsingular valuescondition numbersconic systemsdistance to infeasibilityinfeasible perturbation
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items (23)
K-best feasible clusters - ranking optimal solutions from an infeasible LP ⋮ 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 ⋮ Sufficient conditions for total ill-posedness in linear semi-infinite optimization ⋮ A primal-dual symmetric relaxation for homogeneous conic systems ⋮ Smoothed analysis of condition numbers and complexity implications for linear programming ⋮ A characterization of the distance to infeasibility under block-structured perturbations ⋮ A condition-based algorithm for solving polyhedral feasibility problems ⋮ A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints ⋮ On regularity of convex multifunctions ⋮ Connections between the total least squares and the correction of an infeasible system of linear inequalities ⋮ On the block-structured distance to non-surjectivity of sublinear mappings ⋮ Conic systems and sublinear mappings: equivalent approaches. ⋮ 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 ⋮ The condition number of a function relative to a set ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ Computation of condition numbers for linear programming problems using Peña’s method ⋮ On optimal zero-preserving corrections for inconsistent linear systems ⋮ Probabilistic analysis of the Grassmann condition number ⋮ The radius of metric regularity
This page was built for publication: Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
