Inexact semismooth Newton methods for large-scale complementarity problems

Optimization Methods and Software

Volumn 19, Issue 3-4, 2004, Pages 309-325

  Kanzow, Christian ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Complementarity problems; Newton's method; Obstacle problems; Optimal control problems; Semismooth functions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTION EVALUATION; MATRIX ALGEBRA; NONLINEAR EQUATIONS; SET THEORY; VECTORS;

COMPLEMENTARITY PROBLEMS; NEWTON'S METHOD; OBSTACLE PROBLEMS; OPTIMAL CONTROL PROBLEMS; SEMISMOOTH FUNCTIONS;

PROBLEM SOLVING;

EID: 3042634799     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780310001636369     Document Type: Conference Paper

References (40)

1. M.C. Ferris and J.-S. Pang (1997). Engineering and economic applications of complementarity problems. SIAM Review, 39, 669-713.
2. P.T. Harker and J.-S, Pang (1990). Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Mathematical Programming, 48, 161-220.
3. M.C. Ferris and C. Kanzow (2002). Complementarity and related problems. In: P.M. Pardalos and M.G.C. Resende (Eds.), Handbook of Applied Optimization, pp. 514-530. Oxford University Press, New York, NY.
4. T. De Luca, F. Facchinei and C. Kanzow (1996). A semismooth equation approach to the solution of nonlinear complementarity problems. Mathematical Programming, 75, 407-439.
5. H. Jiang and L. Qi (1997). A new nonsmooth equations approach to nonlinear complementarity problems. SIAM Journal on Control and Optimization, 35, 178-193.
6. N. Yamashita and M. Fukushima (1997). Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. Mathematical Programming, 76, 469-491.
7. F. Facchinei and C. Kanzow (1997). A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Mathematical Programming, 76, 493-512.
8. H. Jiang, M. Fukushima, L. Qi and D. Sun (1998). A trust region method for solving generalized complementarity problems. SIAM Journal on Optimization, 8, 140-157.
9. B. Chen, X. Chen and C. Kanzow (2000). A penalized Fischer-Burmeister NCP-function. Mathematical Programming, 88, 211-216.
10. M. Ulbrich (2001). Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems. SIAM Journal on Optimization, 11, 889-917.
11. S.P. Dirkse and M.C. Ferris (1995). The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software, 5, 123-156.
12. M.C. Ferris and T.S. Munson (1999). Interfaces to PATH 3.0: Design, implementation and usage. Computational Optimization and Applications, 12, 207-227.
13. A. Fischer (1992). A special Newton-type optimization method. Optimization, 24, 269-284.
14. L. Qi and J. Sun (1993). A nonsmooth version of Newton's method. Mathematical Programming, 58, 353-367.
15. L. Qi (1993). Convergence analysis of some algorithms for solving nonsmooth equations. Mathematics of Operations Research, 18, 227-244.
16. F.H. Clarke (1983). Optimization and Nonsmooth Analysis. John Wiley & Sons, New York, NY (reprinted by SIAM, Philadelphia, PA, 1990).
17. S.M. Robinson (1980). Strongly regular generalized equations. Mathematics of Operations Research, 5, 43-62.
18. T.S. Munson, F. Facchinei, M.C. Ferris, A. Fischer and C. Kanzow (2001). The semismooth algorithm for large scale complementarity problems. INFORMS Journal on Computing, 13, 294-311.
19. R.S. Dembo, S.C. Eisenstat and T. Steihaug (1982). Inexact Newton methods. SIAM Journal on Numerical Analysis, 19, 400-408.
20. J.M. Martínez and L. Qi (1995). Inexact Newton methods for solving nonsmooth equations. Journal of Computational and Applied Mathematics, 60, 127-145.
21. F. Facchinei, A. Fischer and C. Kanzow (1996). Inexact Newton methods for semismooth equations with applications to variational inequality problems. In: G. Di Pillo and F. Giannessi (Eds.), Nonlinear Optimization and Applications, pp. 125-139. Plenum Press, New York, NY.
22. S.P. Dirkse and M.C. Ferris (1995). MCPLIB: A collection of nonlinear mixed complementarity problems. Optimization Methods and Software, 5, 319-345.
23. Y. Saad (1996). Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston, MA.
24. L. Grippo, F. Lampariello and S. Lucidi (1986). A nonmonotone line search technique for Newton's method. SIAM Journal on Numerical Analysis, 23, 707-716.
25. C.C. Paige and M.A. Saunders (1982). LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software, 8, 43-71.
26. J.-S. Pang (1990). Newton's method for B-differentiable equations. Mathematics of Operations Research, 15, 311-341.
27. J.-S. Pang (1991). A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. Mathematical Programming, 51, 101-131.
28. P.T. Harker and J.-S. Pang (1990). A damped-Newton method for the linear complementarity problem. In: E.L. Allgower and K. Georg (Eds.), Computational Solution of Nonlinear Systems of Equations, Lectures in Applied Mathematics 26. AMS, Providence, RI.
29. A. Fischer and C. Kanzow (1996). On finite termination of an iterative method for linear complementarity problems. Mathematical Programming, 74, 279-292.
30. D. Sun, J. Han and Y.B. Zhao (1998). On the finite termination of the damped-Newton algorithm for the linear complementarity problem. Acta Mathematica Numerica Applicatae, 21, 148-154.
31. T. De Luca, F. Facchinei and C. Kanzow (2000). A theoretical and numerical comparison of some semismooth algorithms for complementarity problems. Computational Optimization and Applications, 16, 173-205.
32. R.A. Horn and Ch.R. Johnson (1991). Topics in Matrix Analysis. Cambridge University Press, New York, NY.
33. A. Herman and R.J. Plemmons (1979). Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York.
34. R.W. Cottle, J.-S. Pang and R.E. Stone (1992). The Linear Complementarity Problem. Academic Press, San Diego.
35. M. Hintermüller, K. Ito and K. Kunisch (2003). The primal-dual active set strategy as a semi-smooth Newton method. SIAM Journal on Optimization, 13, 865-888.
36. M. Bergounioux, M. Haddou, M. Hintermüller and K. Kunisch (2001). A comparison of a Moreau-Yosida based active set strategy and interior point methods for constrained optimal control problems. SIAM Journal on Optimization, 11, 495-521.
37. J.-F. Rodrigues (1987). Obstacle Problems in Mathematical Physics. North-Holland, Amsterdam.
38. E. Miersemann and H.D. Mittelmann (1989). Continuation for parameterized nonlinear variational inequalities. Journal of Computational and Applied Mathematics, 26, 23-34.
39. R.H.W. Hoppe and H.D. Mittelmann (1989). A multi-grid continuation strategy for parameter-dependent variational inequalities. Journal of Computational and Applied Mathematics, 26, 35-46.
40. S.A. Gabriel and J.-S. Pang (1992). An inexact NE/SQP method for solving the nonlinear complementarity problem. Computational Optimization and Applications, 1, 67-91.