Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
From MaRDI portal
Publication:463718
DOI10.1007/s10107-013-0709-1zbMath1297.90121OpenAlexW2000007405MaRDI QIDQ463718
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0709-1
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items
Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ The Condition Number of Riemannian Approximation Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- A geometric view of parametric linear programming
- Stochastic linear programming. Models, theory, and computation
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- Directional derivative of the value function in parametric optimization
- Computing the radius of pointedness of a convex cone
- Robust Convex Optimization
- A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- The Price of Robustness
- Computational complexity of parametric linear programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Extended Active Constraints in Linear Optimization with Applications
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Robust Optimization of Large-Scale Systems
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Unifying Condition Numbers for Linear Programming
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- A new condition number for linear programming
