A note on the radius of robust feasibility for uncertain convex programs
From MaRDI portal
(Redirected from Publication:5086884)
Recommendations
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- An exact formula for radius of robust feasibility of uncertain linear programs
- Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs
- Radius of robust feasibility of system of convex inequalities with uncertain data
Cites work
- 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
- Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
- Duality in robust optimization: Primal worst equals dual best
- From linear to convex systems: consistency, Farkas' lemma and applications
- Nonsmooth analysis
- On robust duality for fractional programming with uncertainty data
- Optimality and duality for robust multiobjective optimization problems
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Robust convex optimization
- Robust linear semi-infinite programming duality under uncertainty
- Robust optimization
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- Robust solutions of uncertain linear programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust solutions to multi-objective linear programs with uncertain data
- Robust Solutions to Uncertain Semidefinite Programs
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stable Lagrange dualities for robust conical programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Cited in
(9)- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite 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
- An exact formula for radius of robust feasibility of uncertain linear programs
- Radius of robust global error bound for piecewise linear inequality systems
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- Radius of Robust Feasibility for Mixed-Integer Problems
- Radius of robust feasibility for adjustable robust linear inequality systems with affine decision rules
This page was built for publication: A note on the radius of robust feasibility for uncertain convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086884)
