On a semi-smooth Newton method and its globalization

Mathematical Programming

Volumn 118, Issue 2, 2009, Pages 347-370

  Ito, Kazufumi ^a   Kunisch, Karl ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE SET STRATEGIES; MERIT FUNCTIONS; NEWTON METHODS; PAPER ADDRESSES; PRIMAL DUALS;

NEWTON-RAPHSON METHOD;

EID: 58149482583     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0196-3     Document Type: Article

References (16)

1. Clarke F.H. (1983). Optimization and Nonsmooth Analysis. Wiley, New York
2. J.C. de los Reyes K. Kunisch 2004 A comparison of algorithms for control constrained optimal control of the Burgers equation Calcolo 41 203 225
3. Facchinei F. and Pang J.-S. (2003). Finite Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, Berlin
4. S.-H. Han J.-S. Pang N. Rangaraj 1992 Globally convergent Newton methods for nonsmooth equations Math. Oper. Res. 17 586 607
5. A. Haraux 1977 How to differentiate the projection on a closed convex set in Hilbert space. Some applications to variational inequalities J. Math. Soc. Jpn. 29 615 631
6. M. Hintermüller K. Ito K. Kunisch 2002 The primal-dual active set strategy as a semi-smooth Newton method SIAM J. Optim. 13 865 888
7. K. Ito K. Kunisch 2004 The primal-dual active set method for nonlinear optimal control problems with bilateral constraints SIAM J. Control Optim. 43 357 376
8. C. Kanzow 2000 Global optimization techniques for mixed complementarity problems J. Global Optim. 16 1 21
9. C. Kanzow 2004 Inexact semismooth Newton methods for large-scale complementarity problems Optim. Methods Softw. 19 309 325
10. K. Kunisch F. Rendl 2003 An infeasible active set method for convex problems with simple bounds SIAM J. Optim. 14 35 52
11. R. Mifflin 1977 Semismooth and semiconvex functions in constrained optimization SIAM J. Control Optim. 15 959 972
12. J.S. Pang 1990 Newton's method for B-differentiable equations Math. Oper. Res. 15 311 341
13. L. Qi J. Sun 1993 A nonsmooth version of Newton's method Math. Program. 58 353 367
14. L. Qi 1993 Convergence analysis of some algorithms for solving nonsmooth equations Math. Oper. Res. 18 227 244
15. S.M. Robinson 1987 Local structure of feasible sets in nonlinear programming, part III: Stability and sensitivity Math. Program. Study 30 45 66
16. A. Shapiro 1990 On concepts of directional differentiability J. Optim. Theory Appl. 13 477 487