Moreau-Rockafellar theorems for nonconvex set-valued maps

DOI10.1007/s10957-007-9173-5zbMath1146.49014OpenAlexW1970547716MaRDI QIDQ946297

Pham Hu'u Sach

Publication date: 23 September 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-007-9173-5

zbMATH Keywords

set-valued mapsgeneralized convexityBenson proper subgradientsMoreau-Rockafellar theorem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53) Convex functions and convex programs in convex geometry (52A41)

Related Items (5)

Unnamed Item ⋮ Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Approximate duality for vector quasi-equilibrium problems and applications ⋮ Weak subdifferential for set-valued mappings and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly subconvexlike set-valued maps and vector optimization problems
• Inequality systems and optimization
• Conjugate maps and duality in multiobjective optimization
• Alternative theorems and optimality conditions with weakened convexity
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• A theorem of the alternative and its application to the optimization of set-valued maps
• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• A characterization of proper minimal points as solutions of sublinear optimization problems
• Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
• Optimization of set-valued functions
• Lagrange multipliers and saddle points in multiobjective programming
• Near-subconvexlikeness in vector optimization with set-valued functions
• New generalized convexity notion for set-valued maps and application to vector optimization
• Theorems of the alternative and optimization with set-valued maps
• Convexlike alternative theorems and mathematical programming
• Optimality conditions for vector optimisation with set-valued maps
• Convex Analysis
• Minimax Theorems

This page was built for publication: Moreau-Rockafellar theorems for nonconvex set-valued maps