Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems
DOI10.1007/s10957-018-1406-2zbMath1409.90177OpenAlexW2894573228WikidataQ129165075 ScholiaQ129165075MaRDI QIDQ1730392
Publication date: 6 March 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1406-2
optimality conditionssubdifferentialset-valued vector optimizationLagrange/Karush/Kuhn/Tucker multipliers
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- On subdifferential calculus for set-valued mappings and optimality conditions
- Moreau-Rockafellar theorems for nonconvex set-valued maps
- Theory of multiobjective optimization
- Conjugate maps and duality in multiobjective optimization
- Conjugate duality in vector optimization
- A characterization of proper minimal points as solutions of sublinear optimization problems
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- Variational methods in partially ordered spaces
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
This page was built for publication: Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems