Abstract
As a complement of our recent article [O. Stein and A. Tezel, J. Global Optim., 41 (2008), pp. 245–266], we study convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems. The semismooth Newton method is applied to a semismooth reformulation of the upper and lower level Karush–Kuhn–Tucker conditions by nonlinear complementarity problem functions into a semismooth system of equations. In the present paper we assume strict complementary slackness neither in the upper nor in the lower level. The auxiliary functions of the locally reduced problem then are not necessarily twice continuously differentiable. Still, we can show that a standard regularity condition for quadratic convergence of the semismooth Newton method holds under a natural assumption for semi-infinite programs.
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.
