A characterization of the distance to infeasibility under block-structured perturbations

DOI10.1016/S0024-3795(03)00392-6zbMath1028.15003OpenAlexW2132019613MaRDI QIDQ1405035

Javier F. Peña

Publication date: 25 August 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(03)00392-6

zbMATH Keywords

perturbationscondition numbersparse matricessingular valuesdistance to ill-posednessconic systemsdistance to infeasibilitydistance to singularityEckart and Young identity

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Related Items (9)

A short note on the ratio between sign-real and sign-complex spectral radius of a real square matrix ⋮ On the estimate of the distance to non-invertibility ⋮ A primal-dual symmetric relaxation for homogeneous conic systems ⋮ On sign-real spectral radii and sign-real expansive matrices ⋮ On the block-structured distance to non-surjectivity of sublinear mappings ⋮ Conic systems and sublinear mappings: equivalent approaches. ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Coderivative calculus and metric regularity for constraint and variational systems ⋮ Probabilistic analysis of the Grassmann condition number

Cites Work

• Systems of linear interval equations
• Theorems of Perron-Frobenius type for matrices without sign restrictions
• The complex structured singular value
• Linear programming, complexity theory and elementary functional analysis
• Ill-Conditioned Convex Processes and Conic Linear Systems
• Ill-Conditioned Matrices Are Componentwise Near to Singularity
• Continuity properties of the real/complex structured singular value
• The radius of metric regularity
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• A new condition number for linear programming

This page was built for publication: A characterization of the distance to infeasibility under block-structured perturbations