Abstract
In [S. Butikofer, Math. Methods Oper. Res., 68 (2008), pp. 235-256] a nonsmooth Newton method globalized with the aid of a path search was developed in an abstract framework. We refine the convergence analysis given there and adapt this algorithm to certain finite dimensional optimization problems with $C^{1,1}$ data. Such problems arise, for example, in semi-infinite programming under a reduction approach without strict complementarity and in generalized Nash equilibrium models. Using results from parametric optimization and variational analysis, we work out in detail the concrete Newton schemes and the construction of a path for these applications and discuss a series of numerical results for semi-infinite and generalized semi-infinite optimization problems.
Sign-in/Register to access full text options 
Free) 
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 call
