Robust duality for generalized convex programming problems under data uncertainty
From MaRDI portal
Publication:654075
DOI10.1016/j.na.2011.04.006zbMath1254.90154WikidataQ59241531 ScholiaQ59241531MaRDI QIDQ654075
Guoyin Li, Vaithilingam Jeyakumar, Gue Myung Lee
Publication date: 21 December 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2011.04.006
generalized convexity; robust optimization; duality under uncertainty; robust quadratic optimization
90C22: Semidefinite programming
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Unnamed Item, Generalized robust duality in constrained nonconvex optimization, Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty, On approximate solutions for nonsmooth robust multiobjective optimization problems, A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems, Optimality and duality for robust multiobjective optimization problems, Robust canonical duality theory for solving nonconvex programming problems under data uncertainty, On duality for mathematical programs with vanishing constraints, Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment, Robust fuzzy structural safety assessment using mathematical programming approach, Robustness in nonsmooth nonconvex optimization problems, A unifying approach to robust convex infinite optimization duality, On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization, On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems, Robust assessment of collapse resistance of structures under uncertain loads based on info-gap model, Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function, Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces, Robust strong duality for nonconvex optimization problem under data uncertainty in constraint, On approximate efficiency for nonsmooth robust vector optimization problems, Strong duality for robust minimax fractional programming problems, Robust nonlinear optimization with conic representable uncertainty set, Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints, On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty, Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems, Robust approach for uncertain multi-dimensional fractional control optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust linear optimization under general norms.
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Stochastic programming approach to optimization under uncertainty
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Robust optimization-methodology and applications
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Lectures on Stochastic Programming
- A duality theorem for non-linear programming
- On generalised convex mathematical programming
- A Survey of the S-Lemma
