Abstract
We derive characterizations of weak sharp minimizers of order one for the class of lower-C1 functions. The characterizations of such minimizers are obtained for a nonlinear programming problem with an abstract set constraint. The first characterization is formulated in terms of the proximal normals to a given set relative to the abstract set constraint, and the directional derivative of the objective function. Two examples are given to illustrate this characterization. The other characterizations are extensions of the main characterizations of weak sharp minima for convex functions, recently proved by Burke and Deng (2002) [13, Theorems 2.2 and 2.3], to the class of lower-C1 functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
