Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
From MaRDI portal
Publication:654070
DOI10.1016/j.na.2011.03.015zbMath1236.49040OpenAlexW2132775167MaRDI QIDQ654070
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.03.015
necessary optimality conditionsnormal conecoderivativesufficient optimality conditionsvector variational inequalityvector equilibrium problemweakly efficient solutionsset-valued optimization problemproperly efficient solutionsset-valued equilibrium problemPareto efficient solutionsquasi weakly efficient solutionsrelative efficient solutionsstrongly efficient solutions
Multi-objective and goal programming (90C29) Set-valued and variational analysis (49J53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions for problems in abstract spaces (49K27)
Related Items
On optimality conditions for quasi-relative efficient solutions in set-valued optimization ⋮ The Lipschitzianity of convex vector and set-valued functions ⋮ Solving ill-posed bilevel programs ⋮ 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 ⋮ Duality and its applications to optimality conditions with nonsolid cones ⋮ Calmness and exact penalization in constrained scalar set-valued optimization ⋮ Optimality conditions for strong vector equilibrium problems under a weak constraint qualification ⋮ On the use of the quasi-relative interior in optimization ⋮ Henig proper subdifferential of set-valued maps ⋮ On optimality conditions for set-valued equilibrium problems
Cites Work
- Chebyshev scalarization of solutions to the vector equilibrium problems
- On vector quasi-equilibrium problems with set-valued maps
- Existence of equilibria for multivalued mappings and its application to vectorial equilibria
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Lagrangian conditions for vector optimization in Banach spaces
- Connectedness of the solution sets and scalarization for vector equilibrium problems
- Equilibrium and least element problems for multivalued functions
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Existence of solutions for generalized vector equilibrium problems
- Unified representation of proper efficiency by means of dilating cones
- Existence of equilibria for monotone multivalued mappings
- Generalized differential calculus for nonsmooth and set-valued mappings
- On the notion of proper efficiency in vector optimization
- Vector equilibrium problems with generalized monotone bifunctions
- Proper efficiency in locally convex topological vector spaces
- A generalization of vectorial equilibria
- From scalar to vector equilibrium problems in the quasimonotone case
- Generalized vector equilibrium problems with set-valued mappings
- Generalized vector quasi-equilibrium problems.
- Notions of relative interior in Banach spaces
- Scalarization of Henig proper efficient points in a normed space
- Near-subconvexlikeness in vector optimization with set-valued functions
- On generalized vector equilibrium problems.
- An existence result for the generalized vector equilibrium problem
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- Strong vector equilibrium problems
- The Lagrange multiplier rule for super efficiency in vector optimization
- Optimality conditions for vector equilibrium problems
- Vector optimization. Set-valued and variational analysis.
- The system of generalized set-valued equilibrium problems
- Nonconvex differential calculus for infinite-dimensional multifunctions
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- The Fermat rule for multifunctions on Banach spaces
- Optimality Conditions for Problems with Set–Valued Objectives
- Stablity of Set-Valued Mappings In Infinite Dimensions: Point Criteria and Applications
- Approximate subdifferentials and applications 3: the metric theory
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- On Subdifferentials of Optimal Value Functions
- Dual Characterization and Scalarization for Benson Proper Efficiency
- Fuzzy necessary optimality conditions for vector optimization problems
- Lipschitzian properties of multifunctions
- Approximate subdifferentials and applications II
- Super Efficiency in Vector Optimization
- Density Results for Proper Efficiencies
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Metric regularity and subdifferential calculus
- Variational Analysis and Generalized Differentiation I
- Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
- The Lagrange Multiplier Rule for Multifunctions in Banach Spaces
- Efficiency and Henig efficiency for vector equilibrium problems.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
