On the block-structured distance to non-surjectivity of sublinear mappings

DOI10.1007/s10107-004-0514-yzbMath1125.90068OpenAlexW2058658637MaRDI QIDQ2487844

Javier F. Peña

Publication date: 8 August 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0514-y

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

On the estimate of the distance to non-invertibility ⋮ The radius of metric subregularity

Cites Work

• Unnamed Item
• Systems of linear interval equations
• Norm duality for convex processes and applications
• Condition measures and properties of the central trajectory of a linear program
• Theorems of Perron-Frobenius type for matrices without sign restrictions
• A characterization of the distance to infeasibility under block-structured perturbations
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• Linear programming, complexity theory and elementary functional analysis
• Ill-Conditioned Convex Processes and Conic Linear Systems
• Regularity and Stability for Convex Multivalued Functions
• The Componentwise Distance to the Nearest Singular Matrix
• Smooth Goodness-of-Fit Tests for the Baseline Hazard in Cox's Proportional Hazards Model
• Ill-Conditioned Matrices Are Componentwise Near to Singularity
• Variational Analysis
• On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• The radius of metric regularity
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• Convex Analysis
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
• Ill-conditioned inclusions

This page was built for publication: On the block-structured distance to non-surjectivity of sublinear mappings