Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints

DOI10.1016/j.orl.2015.11.011zbMath1408.90235OpenAlexW2234594789WikidataQ59241440 ScholiaQ59241440MaRDI QIDQ1785470

G. Richomme

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/58976

zbMATH Keywords

convex programmingrobust optimizationdata uncertaintyradius of robust feasibility

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15)

Related Items (15)

Robust optimization and data classification for characterization of Huntington disease onset via duality methods ⋮ On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ An exact formula for radius of robust feasibility of uncertain linear programs ⋮ Radius of Robust Feasibility for Mixed-Integer Problems ⋮ A note on the radius of robust feasibility for uncertain convex programs ⋮ Radius of robust global error bound for piecewise linear inequality systems ⋮ Recent contributions to linear semi-infinite optimization ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ A radius of robust feasibility for uncertain farthest Voronoi cells ⋮ Unnamed Item ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex 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

Uses Software

• YALMIP

Cites Work

• Semidefinite representation of convex sets
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Robust convex quadratically constrained programs
• A Frank--Wolfe type theorem for convex polynomial programs
• Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Deriving robust counterparts of nonlinear uncertain inequalities
• Robust solutions to multi-objective linear programs with uncertain data
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
• Theory and Applications of Robust Optimization
• The Price of Robustness
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Stability and Well-Posedness in Linear Semi-Infinite Programming
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Unnamed Item

This page was built for publication: Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints