Optimality conditions for a nonconvex set-valued optimization problem

DOI10.1016/J.CAMWA.2007.11.035MaRDI QIDQ950028zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 22 October 2008

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2007.11.035

zbMATH Keywords

optimality conditionsvector optimizationset-valued functionsconvex and set-valued analysis

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Set-valued and variational analysis (49J53) Programming in abstract spaces (90C48)

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

• 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?)
• 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
• 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

(17)

• An optimality condition for a nondifferentiable convex program
• Optimality and duality for non-Lipschitz multiobjective optimization problems
• Approximate solutions for nonconvex set-valued optimization and vector variational inequality
• scientific article; zbMATH DE number 7351021 (Why is no real title available?)
• Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
• On solutions of set-valued optimization problems
• Lagrange multiplier rule for nonconvex set-valued optimization problem
• First and second-order optimality conditions without differentiability in multivalued vector optimization
• Openness results for multifunctions via an abstract subdifferential
• On -optimality conditions for convex set-valued optimization problems
• Necessary and sufficient optimality conditions for set-valued optimization problems
• Optimality conditions for the difference of convex set-valued mappings
• scientific article; zbMATH DE number 4071885 (Why is no real title available?)
• 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
• Optimality conditions in non-convex set-valued optimization
• scientific article; zbMATH DE number 2156020 (Why is no real title available?)

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)