Characterizations for optimality conditions of general robust optimization problems

DOI10.1007/s10957-018-1256-yzbMath1394.90538OpenAlexW2787988069MaRDI QIDQ1670134

Hong-Zhi Wei, Chun-Rong Chen, Sheng Jie Li

Publication date: 4 September 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1256-y

zbMATH Keywords

image space analysiscorrected imagerobust optimality conditionscalar robust optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)

Related Items (25)

Robust optimality in constrained optimization problems with application in mechanics ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Necessary optimality conditions for nonsmooth robust optimization problems ⋮ Path connectedness of the efficient solution set for generalized vector quasi-equilibrium problems ⋮ Necessary and sufficient optimality conditions for some robust variational problems ⋮ Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ Robustness characterizations for uncertain optimization problems via image space analysis ⋮ On second-order conic programming duals for robust convex quadratic optimization problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Characterizations of robust optimality conditions via image space analysis ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Unnamed Item ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Robust penalty function method for an uncertain multi-time control optimization problems ⋮ Scalarization of multiobjective robust optimization problems ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Dynamic analysis of fractional-order quaternion-valued fuzzy memristive neural networks: vector ordering approach ⋮ Characterizations of multiobjective robustness on vectorization counterparts ⋮ A unified approach through image space analysis to robustness in uncertain optimization problems ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Generalized robust duality in constrained nonconvex optimization ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems ⋮ Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions ⋮ Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty

Cites Work

• Unnamed Item
• Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities
• Image convexity of generalized systems with infinite-dimensional image and applications
• Minmax robustness for multi-objective optimization problems
• Unified duality theory for constrained extremum problems. I: Image space analysis
• Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
• Separation of sets and Wolfe duality
• Separation approach for augmented lagrangians in Constrained nonconvex optimization
• Some applications of the image space analysis to the duality theory for constrained extremum problems
• Duality in robust optimization: Primal worst equals dual best
• Robust discrete optimization and its applications
• Robust solutions of linear programming problems contaminated with uncertain data
• Decision uncertainty in multiobjective optimization
• A unified characterization of multiobjective robustness via separation
• Nonlinear separation approach to constrained extremum problems
• Characterizing robust solution sets of convex programs under data uncertainty
• On robust multiobjective optimization
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Robust Convex Optimization
• Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Nonlinear separation in the image space with applications to penalty methods
• Lipschitz Behavior of the Robust Regularization
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Degrees of Efficiency and Degrees of Minimality
• ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
• Set-valued Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

This page was built for publication: Characterizations for optimality conditions of general robust optimization problems