Robust duality for generalized convex programming problems under data uncertainty

DOI10.1016/j.na.2011.04.006zbMath1254.90154OpenAlexW2103632601WikidataQ59241531 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

zbMATH Keywords

generalized convexityrobust optimizationduality under uncertaintyrobust quadratic optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (34)

Robustness in nonsmooth nonconvex optimization problems ⋮ Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces ⋮ Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ Robust canonical duality theory for solving nonconvex programming problems under data uncertainty ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ On duality for mathematical programs with vanishing constraints ⋮ A unifying approach to robust convex infinite optimization duality ⋮ On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization ⋮ Sufficient Optimality Conditions for a Robust Multiobjective Problem ⋮ Robust duality for the uncertain multitime control optimization problems ⋮ Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints ⋮ Applying convexificators in robust multiobjective optimization ⋮ Robust duality for robust efficient solutions in uncertain vector optimization problems ⋮ On mathematical programs with equilibrium constraints under data uncertainty ⋮ 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 ⋮ Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Approximate solutions for robust multiobjective optimization programming in Asplund spaces ⋮ On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential ⋮ On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems ⋮ Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment ⋮ Robust fuzzy structural safety assessment using mathematical programming approach ⋮ Unnamed Item ⋮ Optimality and duality for robust 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 ⋮ Generalized robust duality in constrained nonconvex optimization ⋮ On approximate solutions for nonsmooth robust multiobjective optimization problems ⋮ A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems ⋮ Strong duality for robust minimax fractional programming problems ⋮ Robust nonlinear optimization with conic representable uncertainty set

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

This page was built for publication: Robust duality for generalized convex programming problems under data uncertainty