Conic systems and sublinear mappings: equivalent approaches.
From MaRDI portal
Publication:703260
DOI10.1016/j.orl.2003.11.006zbMath1059.15007MaRDI QIDQ703260
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.006
Banach spaces; convex cone; linear conic systems; transfer scheme; distance to ill-posedness; data perturbations; sublinear mappings
Cites Work
- A characterization of the distance to infeasibility under block-structured perturbations
- Second-order cone programming
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Regularity and conditioning of solution mappings in variational analysis
- Linear programming, complexity theory and elementary functional analysis
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Ill-Conditioned Convex Processes and Conic Linear Systems
- Semidefinite optimization
- The Componentwise Distance to the Nearest Singular Matrix
- Ill-Conditioned Matrices Are Componentwise Near to Singularity
- Variational Analysis
- coderivatives of set-valued mappings: Calculus and applications
- 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
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Convex Analysis
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Ill-conditioned inclusions
- Unnamed Item
- Unnamed Item