Weak sharp minima in mathematical programming SIAM J Control Optim (1993) F A Khayyal Kyparosis. Finite convergence of algorithms for nonlinear programs and variational inequalities J Optim Theory Appl (1991) M
We derive characterizations of weak sharp minimizers of order one for the class of lower- C 1 functions. The characterizations of such minimizers are obtained for a nonlinear programming problem with an set constraint. The first characterization is formulated in terms of the proximal normals to ...
that, if a constraint qualification is satisfied, standard sufficient conditions often characterize this special sort of minimizer. The first- and second-order cases are treated in detail. Necessary conditions for weak sharp local minima of orderm, a larger class of local minima, are also ...
Nan-jing HuangOptimization: A Journal of Mathematical Programming and Operations ResearchX. B. Li and N. J. Huang, Generalized weak sharp minima in cone-constrained convex opti- mization on Hadamard manifolds, Optimization 64 (2015), 1521-1535....
Mathematical ProgrammingBurke JV, Deng S: Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions. Math Program 2009, 116: 37–56.Burke, J.V., Deng, S.: Weak sharp minima revisited. III. Error bounds for differentiable convex inclusions. Math. Program. (Ser....