Optimality conditions for a nonconvex set-valued optimization problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7351021
- Optimality conditions in non-convex set-valued optimization
- Lagrange multiplier rule for nonconvex set-valued optimization problem
- Generalized optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
- Necessary and sufficient optimality conditions for set-valued optimization problems
Cites work
- A nonconvex vector minimization problem
- Approximations of nondifferentiable functions and local topological equivalence.
- Contingent derivatives of set-valued maps and applications to vector optimization
- Contingent epiderivatives and set-valued optimization
- scientific article; zbMATH DE number 3902413 (Why is no real title available?)
- scientific article; zbMATH DE number 1894726 (Why is no real title available?)
- scientific article; zbMATH DE number 1419402 (Why is no real title available?)
- scientific article; zbMATH DE number 4189484 (Why is no real title available?)
- Invex functions and constrained local minima
- Invex optimisation problems
- Lagrangian duality for preinvex set-valued functions
- Multiobjective duality with invexity
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- On set-valued optimization.
- On subdifferentials of set-valued maps
- On the qualitative approximation of Lipschitzian functions.
- Optimality conditions for set-valued optimization problems
- Optimization of set-valued functions
- Qualitative aspects of the local approximation of a piecewise differentiable function
- Set-relations and optimality conditions in set-valued maps
- Set-valued analysis
- The Lagrange Multiplier Rule in Set-Valued Optimization
- The optimality conditions for vector optimization of set-valued maps
- What is invexity?
Cited in
(20)- Optimality conditions in non-convex set-valued optimization
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization
- Approximate solutions for nonconvex set-valued optimization and vector variational inequality
- Optimality and duality for non-Lipschitz multiobjective optimization problems
- Necessary and sufficient optimality conditions for set-valued optimization problems
- An optimality condition for a nondifferentiable convex program
- scientific article; zbMATH DE number 4071885 (Why is no real title available?)
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Set-valued derivatives of multifunctions and optimality conditions
- scientific article; zbMATH DE number 2156020 (Why is no real title available?)
- scientific article; zbMATH DE number 7351021 (Why is no real title available?)
- Lagrange multiplier rule for nonconvex set-valued optimization problem
- Openness results for multifunctions via an abstract subdifferential
- On solutions of set-valued optimization problems
- Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
- Optimality conditions for Benson proper efficiency of set-valued equilibrium problems
- Optimality conditions for the difference of convex set-valued mappings
- First and second-order optimality conditions without differentiability in multivalued vector optimization
- On -optimality conditions for convex set-valued optimization problems
This page was built for publication: Optimality conditions for a nonconvex set-valued optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950028)
