Global methods for nonlinear complementarity problems

Mathematics of Operations Research

Volumn 21, Issue 3, 1996, Pages 589-614

  Moré, Jorge J ^a  

^a ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Convergence; Nonlinear complementarity; Nonlinear least squares

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; ITERATIVE METHODS; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING;

BOUND CONSTRAINED NONLINEAR LEAST SQUARES PROBLEM; GLOBAL METHODS; LINEAR EQUATIONS; NONLINEAR COMPLEMENTARITY PROBLEMS;

NONLINEAR EQUATIONS;

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

References (51)

1. Ahn, B. H. (1979). Computation of Market Equilibria for Policy Analysis: The Project Independence Evaluation Study (PIES) Approach, Garland Publishing, New York and London.
2. Bertsekas, D. P. (1982). Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20 221-246.
3. Björck, A. (1990). Least squares methods. P. G. Ciarlet and J. L. Lions, Eds., Handbook of Numerical Analysis, City, North-Holland, 465-647.
4. Burke, J. V., J. J. Moré and G. Toraldo (1990). Convergence properties of trust region methods for linear and convex constraints. Math. Programming 47 305-336.
5. Chen, B. and P. T. Harker (1995). A continuation method for monotone variational inequalities. Math. Programming 69 237-253.
6. Coleman, T. F. and Y. Li (1993). An interior trust region approach for nonlinear minimization subject to bounds. Technical report 93-1342, Cornell University, Ithaca, NY.
7. Conn, A. R. N. I. N. Gould and P. L. Toint (1988a). Global convergence of a class of trust region algorithms for optimization problems with simple bounds. SIAM J. Numerical Analysis 25 433-460.
8. _, _ and _ (1988b). Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comp. 50 399-430.
9. Cottle, R. W., J. S. Pang and R. E. Stone (1992). The Linear Complementarity Problem, Academic Press, NY.
10. Dirkse, S. P. and M. C. Ferris (1995a). The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optim. Methods Software 5 123-156.
11. _ and _ (1995b). MCPLIB: A collection of nonlinear mixed complementarity problems. Optim. Methods Software 5 319-345.
12. Fiedler, M. and V. Pták (1962). On matrices with non-positive off-diagonal elements and positive principal minors. Czech. Math. J. 12 382-400.
13. _ and _ (1966). Some generalizations of positive definiteness and monotonicity. Numer. Mathematics 9 163-172.
14. Freund, R. W., G. H. Golub and N. M. Nachtigal (1992). Iterative solution of linear systems. A. Iserles, Ed., Acta Numerica 1992, Cambridge University Press, City, 57-100.
15. Fukushima, M. (1992). Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Programming 53 99-110.
16. Gabriel, S. A. and J. S. Pang (1992). An inexact NE/SQP method for solving the nonlinear complementarity problem. Comp. Optim. Appl. 1 67-91.
17. _ and _ (1993). A trust region method for constrained nonsmooth equations. W. W. Hager, D. W. Hearn and P. M. Pardalos, Eds., Large-Scale Optimization: State of the Art, Kluwer Academic Publishers, Inc.
18. Gay, D. M. (1984). A trust region approach to linearly constrained optimization. D. F. Griffiths, Ed-, Numerical Analysis, Lecture Notes in Mathematics 1066, Springer-Verlag, Berlin, 72-105.
19. Geiger, C. and C. Kanzow (1994). On the resolution of monotone complementarity problems. Preprint 82, Universität Hamburg, Hamburg, Germany.
20. Harker, P. T. and J. S. Pang (1990). Finite dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Math. Programming 18 161-220.
21. _ and B. Xiao (1990). Newton's method for the nonlinear complementarity problem: A B-differentiable equation problem. Math. Programming 48 339-357.
22. Kanzow, C. (1993a). Nonlinear complementarity as unconstrained optimization. Preprint 67, Universität Hamburg, Hamburg, Germany.
23. _ (1993b). Some equation-based methods for the nonlinear complementarity problem. Preprint 63, Universität Hamburg, Hamburg, Germany.
24. Kojima, M., N. Megiddo and S. Mizuno (1993). A general framework of continuation method for complementarity problems. Math. Oper. Res. 18 945-963.
25. _, _ and T. Noma (1991). Homotopy continuation methods for nonlinear complementarity problems. Math. Oper. Res. 16 754-774.
26. _, S. Mizuno and T. Noma (1989). A new continuation method for complementarity problems with uniform P-functions. Math. Programming 43 107-113.
27. _, _ and _ (1990). Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems. Math. Oper. Res. 15 662-675.
28. _, _ and A. Yoshise (1994). Global convergence in infeasible interior point algorithms. Math. Programming 65 43-72.
29. Lescrenier, M. (1991). Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold. SJAM J. Numer. Anal. 28 476-495.
30. Mangasarian, O. L. (1976). Equivalence of the complementarity problem to a system of nonlinear equations, SIAM J. Appl. Math. 31 89-92.
31. _ and M. V. Solodov (1993). Nonlinear complementarity as unconstrained and constrained minimization. Math. Programming 62 277-297.
32. Manne, A. S. (Ed.) (1985). Economic Equilibrium: Model Formulation and Solution. Mathematical Programming Study 23. North-Holland, Amsterdam.
33. McLinden, L. (1980). The complementarity problem for maximal monotone multifunctions. R. W. Cottle, F. Giannessi and J.-L. Lions, Eds., Variational Inequalities and Complementarity Problems, John Wiley & Sons, New York, 251-268.
34. Monteiro, R. D. C., J. S. Pang and T. Wang (1995). A positive algorithm for the nonlinear complementarity problem. SIAM J. Optim. 5 129-148.
35. Moré, J. J. (1974a). Classes of function and feasibility conditions in nonlinear complementarity problems. Math. Programming 6 327-338.
36. _ (1974b). Coercivity conditions in nonlinear complementarity problems. SIAM Rev. 16 1-16.
37. _ and W. C. Rheinboldt (1973). On P- and S-functions and related classes of n-dimensional mappings. Linear Algebra Appl. 6 45-68.
38. _ and G. Toraldo (1991). On the solution of large quadratic programming problems with bound constraints. SIAM J. Optimization 1 93-113.
39. Nagurney, A. (Ed.) (1993). Advances in Equilibrium Modeling, Analysis and Computation. Annals of Operations Research 44 J. C. Baltzer AG.
40. Ortega, J. M. and W. C. Rheinboldt (1970). Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, NY.
41. Pang, J. S. (1990). Newton's method for B-differentiable equations. Math. Oper. Res. 15 311-341.
42. _ and S. A. Gabriel (1993). NE/SQP: A robust algorithm for the nonlinear complementarity problem. Math. Programming 60 295-337.
43. Ralph, D. (1994). Global convergence of damped Newton's method for nonsmooth equations via the path search. Math. Oper. Res. 19 352-389.
44. Robinson, S. M. (1992). Normal maps induced by linear transformations. Math. Oper. Res. 17 691-714.
45. Soares, J., J. Júdice and F. Facchinei (1993). An active set Newton's method for large-scale nonlinear programs with box constraints. Technical Report 367, IASI-CNR, Rome, Italy.
46. Subramanian, P. K. (1993). Gauss-Newton methods for complementarity problems. J. Optim. Theory Appl. 77 467-482.
47. Watson, L. T. (1976). Solving the nonlinear complementarity problem by a homotopy method. SIAM J. Control Optim. 17 36-46.
48. Wright, S. J. (1992). A superlinear infeasible interior-point algorithm for monotone complementarity problems. Preprint MCS-P344-1292, Argonne National Laboratory, Argonne, IL. Revised July 1993.
49. _ (1994). Stability of linear equations solvers in interior-point methods. SIAM J. Matrix Anal. Appl. 16 1287-1307.
50. Xiao, B. and P. T. Harker (1994a). A nonsmooth Newton method for variational inequalities, I: Theory. Math. Programming 65 151-194.
51. _ and _ (1994b). A nonsmooth Newton method for variational inequalities, II: Numerical Results. Math. Programming 65 195-216.