Global convergence analysis of the generalized Newton and Gauss-Newton methods of the Fischer-Burmeister equation for the complementarity problem

Mathematics of Operations Research

Volumn 24, Issue 3, 1999, Pages 529-543

  Jiang, Houyuan ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; NONLINEAR EQUATIONS; PROBLEM SOLVING;

FISCHER-BURMEISTER EQUATIONS; GAUSS-NEWTON METHODS;

OPERATIONS RESEARCH;

EID: 0033365565     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.3.529     Document Type: Article

References (45)

1. Billups, S. C., S. P. Dirkse, M. C. Ferris. 1997. A comparison of algorithms for large scale mixed complementarity problems. Comput. Optimization Appl. 7 3-25.
2. Clarke, F. H. 1983. Optimization and Nonsmooth Analysis. Wiley, New York.
3. Cottle, R. W., J.-S. Pang, R. E. Stone. 1992. The Linear Complementarity Problems. Academic Press, New York.
4. De Luca, T., F. Facchinei, C. Kanzow. 1996. A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Programming 75 407-439.
5. Dennis, J. E., R. B. Schnabel. 1983. Numerical Methods for Unconstrained Optimization and Nonlinear Equation. Prentice Hall, Englewood Cliffs, NJ.
6. Dirkse, S. P., M. C. Ferris. 1995. The PATH Solver: A non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software 5 123-156.
7. Facchinei, F., C. Kanzow. 1997. A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Math. Programming 76 493-512.
8. _, J. Soares. 1997. A new merit function for nonlinear complementarity problems and a related algorithm. SIAM J. Optimization 7 225-247.
9. Ferris, M. C., J.-S. Pang. 1997a. Engineering and economic applications of complementarity problems. SIAM Review 39 669-713.
10. _, _. 1997b. Complementarity and Variational Problems: State of the Art. SIAM Publications, Philadelphia, PA.
11. _, D. Ralph. 1995. Projected gradient methods for nonlinear complementarity problems via normal maps. D. Du, L. Qi and R. Womersley, eds. Recent Advances in Nonsmooth Optimization. World Scientific Publishers, Singapore, 88-105.
12. Fischer, A. 1992. A special Newton-type optimization method. Optimization 24 269-284.
13. _. 1995. On the superlinear convergence of a Newton-type method for LCP under weak conditions. Optimization Methods and Software 6 83-107.
14. _. 1997. Solution of monotone complementarity problems with locally Lipschitzian functions. Math. Programming 76 513-532.
15. Fletcher, R. 1987. Practical Methods of Optimization, 2nd Edition. John Wiley, New York.
16. Fukushima, M. 1996. Merit functions for variational inequality and complementarity problems. G. Di Pillo and F. Giannessi, eds. Nonlinear Optimization and Applications, Plenum Press, New York. 155-170.
17. Gabriel, S. A., J.-S. Pang. 1994. A trust region method for constrained nonsmooth equations. W. W. Hager, D. W. Hearn and P. Pardalos, eds. Large-Scale Optimization: State of the Art, Kluwer Academic Publishers, Boston, 159-186.
18. Han, J., D. Sun. 1997. Newton and quasi-Newton methods for normal maps with polyhedral sets. J. Optimization Theory Appl., 94(3) 659-676.
19. Han, S. P., J.-S. Pang, N. Rangaraj. 1992. Globally convergent Newton methods for nonsmooth equations. Math. Oper. Res. 17 586-607.
20. Harker, P. T., J.-S. Pang. 1990a. Finite-dimensional variational inequality and nonlinear complementarity problem: A survey of theory, algorithms and applications. Math. Programming 48 161-220.
21. _, _. 1990b. A damped-Newton method for the linear complementarity problem. E. L. Allgower and K. Georg, eds. Computational Solution of Nonlinear Systems of Equations, American Mathematical Society, Providence, RI. 265-184.
22. _, B. Xiao. 1990. Newton method for the nonlinear complementarity problem: A B-differentiable equation approach. Math. Programming (B) 48 339-357.
23. Jiang, H., M. Fukushima, L. Qi, D. Sun. 1998. A trust region method for solving generalized complementarity problems. SIAM J. Optimization 8 140-157.
24. _, L. Qi. 1997. A new nonsmooth equations approach to nonlinear complementarity problems. SIAM J. Control Optimization 35 178-193.
25. Kanzow, C. 1994a. An unconstrained optimization techniques for large-scale linearly constrained convex minimization problems. Computing 53 101-117.
26. _. 1994b. Some equation-based methods for the nonlinear complementarity problem. Optimization Methods and Software 3 327-340.
27. _, H. Kleinmichel. 1997. A new class of semismooth Newton-type methods for nonlinear complementarity problems. Preprint 118, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany.
28. Luo, Z.-Q., P. Tseng. 1997. A new class of merit functions for the nonlinear complementarity problem. M. C. Ferris and J.-S. Pang, eds. Complementarity and Variational Problems: State of the Art, SIAM Publications, Philadelphia, PA.
29. Mangasarian, O. L. 1976. Equivalence of the complementarity problem to a system of nonlinear equations. SIAM J. Appl. Math. 31 89-92.
30. Moré, J. J. 1996. Global methods for nonlinear complementarity problems. Math. Oper. Res. 21 589-614.
31. Ortega, J. M., W. C. Rheinboldt. 1970. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.
32. Pang, J.-S. 1990. Newton's methods for B-differentiable equations. Math. Oper. Res. 15 311-341.
33. _. 1991. A B-differentiable equation based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity, and variational inequality problems. Math. Programming 51 101-131.
34. _. 1994. Complementarity problems. R. Horst and P. Pardalos, eds., Handbook of Global Optimization. Kluwer Academic Publishers, Boston, 271-338.
35. _, S. A. Gabriel. 1993. NE/SQP: A robust algorithm for the nonlinear complementarity problem. Math. Programming 60 295-337.
36. Qi, L. 1993. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18 227-244.
37. _, J. Sun. 1993. A nonsmooth version of Newton's method. Math. Programming 58 353-368.
38. D. Ralph. 1994. Global convergence of damped Newton's method for nonsmooth equations, via the path search. Math. Oper. Res. 19 352-389.
39. _, S. Scholtes. 1997. Sensitivity analysis and Newton's method for composite piecewise smooth equations. Math. Programming 76 593-612.
40. Robinson, S. M. 1994. Newton's method for a class of nonsmooth equations. Set-valued Analy. 2 291-305.
41. Subramanian, P. K. 1993. Gauss-Newton methods for the complementarity problem. J. Optimization Theory Appl. 77 467-482.
42. Sun, D., R. S. Womersley. 1996. A new unconstrained differentiable merit function for box constrained variational inequality problems and a damped Gauss-Newton method. SIAM J. Optimization, to appear.
43. Tseng, P. 1996. Growth behavior of a class of merit functions for the nonlinear complementarity problem. J. Optimization Theory Appl. 89 17-38.
44. Xiao, B., P. T. Harker. 1994. A nonsmooth Newton method for variational inequalities, I: Theory. Math. Programming 65 151-194.
45. Yamashita, N., M. Fukushima. 1997. Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. Math. Programming 76 469-491.