Characterizations of robust solution for convex optimization problems with data uncertainty
From MaRDI portal
Recommendations
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Characterizing robust solution sets of convex programs under data uncertainty
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizing the weighted robust optimal solution sets of optimization problem with data uncertainty via dual approaches
- scientific article; zbMATH DE number 7295977
Cited in
(16)- Characterizing robust solution sets of convex programs under data uncertainty
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Characterization of the radius of the robust feasibility for a class of uncertain convex optimization problems with polynomial constraints
- A characterization of ill-posed data instances for convex programming.
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizing the weighted robust optimal solution sets of optimization problem with data uncertainty via dual approaches
- Characterizations of robust duality for a class of uncertain optimization problems
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
- Optimality conditions for a nonsmooth uncertain multiobjective programming problem
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
This page was built for publication: Characterizations of robust solution for convex optimization problems with data uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130963)
