Radius of robust feasibility of system of convex inequalities with uncertain data
From MaRDI portal
Publication:2302748
DOI10.1007/s10957-019-01607-7zbMath1433.49023OpenAlexW2985317485MaRDI QIDQ2302748
Yibing Lv, Jen-Chih Yao, Jun Li, Jia-wei Chen, Xiao-bing Li
Publication date: 26 February 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01607-7
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53)
Related Items (12)
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 ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ Duality for robust linear infinite programming problems revisited ⋮ Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs ⋮ Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data ⋮ Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Nonsmooth analysis
- Conjugate duality in convex optimization
- Adjustable robust solutions of uncertain linear programs
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Weighted robust optimality of convex optimization problems with data uncertainty
- Characterizing robust solution sets of convex programs under data uncertainty
- An exact formula for radius of robust feasibility of uncertain linear programs
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust solutions to multi-objective linear programs with uncertain data
- Lectures on Modern Convex Optimization
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Nonlinear Optimization
- A note on the radius of robust feasibility for uncertain convex programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Radius of robust feasibility of system of convex inequalities with uncertain data
