Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
From MaRDI portal
Publication:5116045
zbMATH Open1463.90167MaRDI QIDQ5116045FDOQ5116045
Gue Myung Lee, Nithirat Sisarat, Rabian Wangkeeree
Publication date: 21 August 2020
Recommendations
- Characterizations of robust solution set of convex programs with uncertain data
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Characterizations of robust solution for convex optimization problems with data uncertainty
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Characterizing robust solution sets of convex programs under data uncertainty
\(\varepsilon\)-subdifferentialrobust solutionsequential optimality conditionsconjugate functionrobust convex optimization
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
This page was built for publication: Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116045)