An Algorithm for Calculating One Subgradient of a Convex Function of Two Variables.
On weak sharp minima for a special class of nonsmooth functions
We present a characterization of weak sharp local minimizers of order one for a function f: ℝⁿ → ℝ defined by , where the functions are strictly differentiable. It is given in terms of the gradients of and the Mordukhovich normal cone to a given set on which f is constant. Then we apply this result to a smooth nonlinear programming problem with constraints.
Weak sharp minima in multiobjective optimization
Page 1