The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
From MaRDI portal
Publication:4988111
zbMath1460.90141arXiv2107.12084MaRDI QIDQ4988111
Vu Anh Tuan, Christiane Tammer, Ernest Quintana, Gemayqzel Bouza Allende
Publication date: 11 May 2021
Full work available at URL: https://arxiv.org/abs/2107.12084
optimality conditionsset optimizationnonlinear scalarizationslimiting (Mordukhovich) subdifferential
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (4)
A Vectorization Scheme for Nonconvex Set Optimization Problems ⋮ On successive approximations for compact-valued nonexpansive mappings ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ Existence of Lagrange multipliers for set optimization with application to vector equilibrium problems
This page was built for publication: The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
