On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty

DOI10.1080/01630563.2021.2001827zbMath1490.90210OpenAlexW3212493251MaRDI QIDQ5069193

Suliman Al-Homidan, Mei Wang, Xiao-bing Li, Jia-wei Chen

Publication date: 8 April 2022

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2021.2001827

zbMATH Keywords

data uncertaintyradius of robust feasibilityconvex conic programpiecewise linear conic program

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)

Related Items (1)

On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On robust duality for fractional programming with uncertainty data
• Nonsmooth analysis
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Applications of second-order cone programming
• A Frank--Wolfe type theorem for convex polynomial programs
• Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
• Some geometric results in semidefinite programming
• Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs
• Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
• On approximate solutions and saddle point theorems for robust convex optimization
• The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Radius of robust feasibility of system of convex inequalities with uncertain data
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
• An exact formula for radius of robust feasibility of uncertain linear programs
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Matrix sum-of-squares relaxations for robust semi-definite programs
• Robust solutions to multi-objective linear programs with uncertain data
• Radius of robust global error bound for piecewise linear inequality systems
• Lectures on Modern Convex Optimization
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
• Theory and Applications of Robust Optimization
• A note on the radius of robust feasibility for uncertain convex programs

This page was built for publication: On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty