Weak and strong subgradients of set-valued maps (Q635799): Difference between revisions

The authors consider set-valued optimization problems and introduce a new so-called strong subgradient of a set-valued map. Then, they compare this new concept with the well-known weak subgradient and provide sufficient conditions for the existence of these both types of subgradients. Finally, several optimality conditions are discussed.