Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
From MaRDI portal
(Redirected from Publication:6197115)
Abstract: This article is devoted to investigate a nonsmooth/nonconvex uncertain multiobjective optimization problem with composition fields ( for brevity) over arbitrary Asplund spaces. Employing some advanced techniques of variational analysis and generalized differentiation, we establish necessary optimality conditions for weakly robust efficient solutions of in terms of the limiting subdifferential. Sufficient conditions for the existence of (weakly) robust efficient solutions to such a problem are also driven under the new concept of pseudo-quasi convexity for composite functions. We formulate a Mond-Weir-type robust dual problem to the primal problem , and explore weak, strong, and converse duality properties. In addition, the obtained results are applied to an approximate uncertain multiobjective problem and a composite uncertain multiobjective problem with linear operators.
Recommendations
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Optimality and duality of properly robust efficient solutions in uncertain multi-objective optimization problems
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
Cites work
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- A simple constraint qualification in infinite dimensional programming
- Approximate solutions of multiobjective optimization problems
- Characterizing robust solution sets of convex programs under data uncertainty
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Descent methods for composite nondifferentiable optimization problems
- Duality in robust optimization: Primal worst equals dual best
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Geometry of optimality conditions and constraint qualifications: The convex case
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Minmax robustness for multi-objective optimization problems
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- On -solutions for convex optimization problems with uncertainty data
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- 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
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On robust multiobjective optimization
- Optimality and duality for robust multiobjective optimization problems
- Optimality and duality in nonsmooth conic vector optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Robust duality for generalized convex programming problems under data uncertainty
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust optimization-methodology and applications
- Selected topics in robust convex optimization
- Strong duality in robust convex programming: complete characterizations
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Two Types of Approximate Saddle Points
- Variational methods in partially ordered spaces
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
Cited in
(1)
This page was built for publication: Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197115)
