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

DOI10.2298/FIL1819809LzbMATH Open1499.49078OpenAlexW2941078816WikidataQ127985958 ScholiaQ127985958MaRDI QIDQ5086884FDOQ5086884

Authors: X. B. Li, Qilin Wang 

Publication date: 7 July 2022

Published in: Filomat (Search for Journal in Brave)

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

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

zbMATH Keywords

robust optimizationuncertainty setuncertain convex programradius of robust feasibility

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• 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
• Radius of Robust Feasibility for Mixed-Integer Problems
• 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: 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)