Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems

DOI10.1007/978-1-4419-0158-3_21zbMath1184.49025OpenAlexW205925530MaRDI QIDQ5188756

Trúóng Xuân Dúc Hā

Publication date: 5 March 2010

Published in: Nonlinear Analysis and Variational Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-0158-3_21

zbMATH Keywords

set-valued optimization problemLagrange multiplier ruleweak efficient solutionsFermat ruleBenson proper efficient solutionsstrong efficient solutionssuper efficient solutionsBorwein proper efficient solutionsHartley proper efficient solutionsHenig global proper efficient solutionsHenig proper efficient solutionsHurwicz proper efficient solutionspositive proper efficient solutions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Optimality conditions for problems in abstract spaces (49K27)

Related Items (40)

The Lipschitzianity of convex vector and set-valued functions ⋮ The Ekeland variational principle for Henig proper minimizers and super minimizers ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ Higher-order optimality conditions in set-valued optimization using radial sets and radial derivatives ⋮ Convergence of a class of penalty methods for constrained scalar set-valued optimization ⋮ Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Convergence of relaxed minimizers in set optimization ⋮ First and second-order optimality conditions without differentiability in multivalued vector optimization ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Existence of optimal points via improvement sets ⋮ Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization ⋮ Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization ⋮ Connectedness of Henig weakly efficient solution set for set-valued optimization problems ⋮ First and second-order optimality conditions using approximations for vector equilibrium problems with constraints ⋮ Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization ⋮ Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications ⋮ Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems ⋮ Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces ⋮ On higher-order sensitivity analysis in nonsmooth vector optimization ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Second-order optimality conditions for set optimization using coradiant sets ⋮ Optimality conditions in set optimization employing higher-order radial derivatives ⋮ Higher-order optimality conditions for proper efficiency in nonsmooth vector optimization using radial sets and radial derivatives ⋮ Improvement sets and vector optimization ⋮ Characterization of properly optimal elements with variable ordering structures ⋮ Second-order conditions for open-cone minimizers and firm minimizers in set-valued optimization subject to mixed constraints ⋮ Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints ⋮ Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality ⋮ Existence and Convergence of Optimal Points with Respect to Improvement Sets ⋮ A set-valued Lagrange theorem based on a process for convex vector programming ⋮ Stability and scalarization for a unified vector optimization problem ⋮ Optimality conditions for vector optimization problems with variable ordering structures ⋮ Second-order optimality conditions in set-valued optimization via asymptotic derivatives ⋮ Well-posedness for set optimization problems involving set order relations ⋮ A unified characterization of nonlinear scalarizing functionals in optimization ⋮ Unnamed Item ⋮ Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes

This page was built for publication: Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems