A note on the radius of robust feasibility for uncertain convex programs

DOI10.2298/FIL1819809LzbMath1499.49078OpenAlexW2941078816WikidataQ127985958 ScholiaQ127985958MaRDI QIDQ5086884

Qi-Lin Wang, Xiao-bing Li

Publication date: 7 July 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1819809l

zbMATH Keywords

robust optimizationuncertainty setuncertain convex programradius of robust feasibility

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31) Optimality conditions (49K99)

Related Items

On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ Radius of Robust Feasibility for Mixed-Integer Problems ⋮ Radius of robust global error bound for piecewise linear inequality systems ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust linear semi-infinite programming duality under uncertainty
• On robust duality for fractional programming with uncertainty data
• Nonsmooth analysis
• Duality in robust optimization: Primal worst equals dual best
• Robust solutions of uncertain linear programs
• Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
• 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
• Robust solutions to multi-objective linear programs with uncertain data
• Robust Convex Optimization
• Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
• Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases
• Robust Solutions to Uncertain Semidefinite Programs
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Stability and Well-Posedness in Linear Semi-Infinite Programming
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Optimality and duality for robust multiobjective optimization problems