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

From MaRDI portal
Publication:5188756


DOI10.1007/978-1-4419-0158-3_21zbMath1184.49025MaRDI 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


49J52: Nonsmooth analysis

49J53: Set-valued and variational analysis

49K27: Optimality conditions for problems in abstract spaces


Related Items

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