Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs
From MaRDI portal
Publication:2032008
Abstract: The radius of robust feasibility provides a numerical value for the largest possible uncertainty set that guarantees robust feasibility of an uncertain linear conic program. This determines when the robust feasible set is non-empty. Otherwise the robust counterpart of an uncertain program is not well-defined as a robust optimization problem. In this paper, we address a key fundamental question of robust optimization: How to compute the radius of robust feasibility of uncertain linear conic programs, including linear programs? We first provide computable lower and upper bounds for the radius of robust feasibility for general uncertain linear conic programs under the commonly used ball uncertainty set. We then provide important classes of linear conic programs where the bounds are calculated by finding the optimal values of related semidefinite linear programs (SDPs), among them uncertain SDPs, uncertain second-order cone programs and uncertain support vector machine problems. In the case of an uncertain linear program, the exact formula allows us to calculate the radius by finding the optimal value of an associated second-order cone program.
Recommendations
- An exact formula for radius of robust feasibility of uncertain linear programs
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- A note on the radius of robust feasibility for uncertain convex programs
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
Cites work
- scientific article; zbMATH DE number 490143 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A note on the radius of robust feasibility for uncertain convex programs
- Advances and Trends in Optimization with Engineering Applications
- An exact formula for radius of robust feasibility of uncertain linear programs
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Evaluating Gas Network Capacities
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Robust facility location
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- Robust solutions to multi-objective linear programs with uncertain data
- Selected topics in robust convex optimization
- Variational methods in partially ordered spaces
Cited in
(10)- A note on the radius of robust feasibility for uncertain convex programs
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Copositive tensor optimization problem and its applications to hypergraphs
- Radius of Robust Feasibility for Mixed-Integer Problems
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
- The stability of robustness for conic linear programs with uncertain data
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- An exact formula for radius of robust feasibility of uncertain linear programs
This page was built for publication: Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032008)
