Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
From MaRDI portal
(Redirected from Publication:463718)
Recommendations
- Robust sensitivity analysis for linear programming with ellipsoidal perturbation
- Robust convex optimization
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- Robust sensitivity analysis of the optimal value of linear programming
- Linear programming with uncertain data: some extensions to robust optimization
Cites work
- scientific article; zbMATH DE number 3140980 (Why is no real title available?)
- scientific article; zbMATH DE number 3144731 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- A geometric view of parametric linear programming
- A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems
- A new condition number for linear programming
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Computational complexity of parametric linear programming
- Computing the radius of pointedness of a convex cone
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Directional derivative of the value function in parametric optimization
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- Extended Active Constraints in Linear Optimization with Applications
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- On duality theory of conic linear problems.
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
- Robust Optimization of Large-Scale Systems
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust convex optimization
- Stochastic linear programming. Models, theory, and computation
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- Unifying Condition Numbers for Linear Programming
Cited in
(6)- 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
- Robust sensitivity analysis for linear programming with ellipsoidal perturbation
- A geometric branch and bound method for robust maximization of convex functions
- Complexity of convex optimization using geometry-based measures and a reference point
- The Condition Number of Riemannian Approximation Problems
This page was built for publication: Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463718)
