Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
From MaRDI portal
Publication:868540
DOI10.1007/s10957-006-9097-5zbMath1278.90249OpenAlexW1963712247MaRDI QIDQ868540
Marco A. López, Juan Parra, Maria J. Cánovas, F. Javier Toledo
Publication date: 6 March 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9097-5
Related Items
LP relaxations for a class of linear semi-infinite programming problems, Marco A. López, a pioneer of continuous optimization in Spain, Stability in linear optimization and related topics. A personal tour, The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments, Stability of the primal-dual partition in linear semi-infinite programming
Cites Work
- Some perturbation theory for linear programming
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Linear programming, complexity theory and elementary functional analysis
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Approximation of set-valued functions by single-valued one
- Distance to Solvability/Unsolvability in Linear Optimization
- Convex Analysis
