Some characterizations of robust optimal solutions for uncertain convex optimization problems
From MaRDI portal
Recommendations
- Characterizations of robust solution for convex optimization problems with data uncertainty
- Characterizations of robust duality for a class of uncertain optimization problems
- Characterizing robust solution sets of convex programs under data uncertainty
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- Characterizations of robust solution set of convex programs with uncertain data
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A duality theorem for non-linear programming
- Characterizing robust solution sets of convex programs under data uncertainty
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Conjugate duality in convex optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Constructing uncertainty sets for robust linear optimization
- Convex Analysis
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Duality in robust optimization: Primal worst equals dual best
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Lectures on Stochastic Programming
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- On nonsmooth optimality theorems for robust optimization problems
- On robust convex multiobjective optimization
- On robust duality for fractional programming with uncertainty data
- On strong and total Lagrange duality for convex optimization problems
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust convex optimization
- Robust duality in parametric convex optimization
- Robust optimization
- Robust optimization-methodology and applications
- Strong duality in robust convex programming: complete characterizations
- Theory and applications of robust optimization
- Wolfe duality and Mond-Weir duality via perturbations
Cited in
(35)- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Necessary optimality conditions for nonsmooth robust optimization problems
- Robust nonlinear optimization with conic representable uncertainty set
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Robustness in nonsmooth nonconvex optimization problems
- Weighted robust optimality of convex optimization problems with data uncertainty
- Characterizing robust solution sets of convex programs under data uncertainty
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Robustness characterizations for uncertain optimization problems via image space analysis
- An uncertain minimization problem: robust optimization versus optimization of robustness
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- A note on issues of over-conservatism in robust optimization with cost uncertainty
- Applying convexificators in robust multiobjective optimization
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Characterizing the weighted robust optimal solution sets of optimization problem with data uncertainty via dual approaches
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
- Characterizations of robust duality for a class of uncertain optimization problems
- On approximate solutions and saddle point theorems for robust convex optimization
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Characterizations of robust solution for convex optimization problems with data uncertainty
- Robust solutions of split feasibility problem with uncertain linear operator
- Convexity and closedness in stable robust duality
- A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces
- On uncertain conical convex optimization problems
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- Characterizations of robust solution set of convex programs with uncertain data
- Radius of robust feasibility of system of convex inequalities with uncertain data
This page was built for publication: Some characterizations of robust optimal solutions for uncertain convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331984)
