Some characterizations of robust optimal solutions for uncertain convex optimization problems
From MaRDI portal
Publication:331984
DOI10.1007/s11590-015-0946-8zbMath1379.90045MaRDI QIDQ331984
Xiang-Kai Sun, Xiao-Le Guo, Zai-Yun Peng
Publication date: 27 October 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0946-8
Related Items
Unnamed Item, Necessary optimality conditions for nonsmooth robust optimization problems, Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators, Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials, Applying convexificators in robust multiobjective optimization, Robust duality for robust efficient solutions in uncertain vector optimization problems, Robustness in nonsmooth nonconvex optimization problems, Characterizations of robust solution set of convex programs with uncertain data, On quasi \(\epsilon\)-solution for robust convex optimization problems, Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators, Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization, Robust strong duality for nonconvex optimization problem under data uncertainty in constraint, Weighted robust optimality of convex optimization problems with data uncertainty, Robustness characterizations for uncertain optimization problems via image space analysis, On approximate solutions and saddle point theorems for robust convex optimization, Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty, Radius of robust feasibility of system of convex inequalities with uncertain data, Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems, Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints, Convexity and closedness in stable robust duality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- On robust duality for fractional programming with uncertainty data
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Wolfe duality and Mond-Weir duality via perturbations
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Duality in robust optimization: Primal worst equals dual best
- Conjugate duality in convex optimization
- Robust optimization-methodology and applications
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- On strong and total Lagrange duality for convex optimization problems
- Robust Convex Optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Theory and Applications of Robust Optimization
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Lectures on Stochastic Programming
- A duality theorem for non-linear programming
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Convex Analysis
