A superlinearly convergent algorithm for the monotone nonlinear complementarity problem without uniqueness and nondegeneracy conditions

Mathematics of Operations Research

Volumn 27, Issue 4, 2002, Pages 743-754

  Dan, Hiroshige ^a,b   Yamashita, Nobuo ^a   Fukushima, Masao ^a  

^a KYOTO UNIVERSITY   (Japan)

^b Mathematical Systems Inc   (Japan)

Author keywords

Nonlinear complementarity problem; Superlinear convergence

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; PROBLEM SOLVING; SET THEORY; VECTORS;

NONLINEAR COMPLEMENTARITY PROBLEM; PROXIMAL POINT ALGORITHM;

NONLINEAR EQUATIONS;

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

References (18)

1. Bertsekas, D. P. 1995 Nonlinear Programming. Athena Scientific, Belmont, MA.
2. Chen, X. 2000. Smoothing methods for complementarity problems and their applications: A survey. J. Oper. Res. Soc. Japan 43 32-47.
3. Dan, H., N. Yamashita, M. Fukushima. 2001. Convergence properties of the inexact Levenberg-Marquardt method under local error bound conditions. Optimization Methods and Software. Forthcoming.
4. De Luca, T., F. Facchinei, C. Kaznow. 1996. A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Programming 75 407-439.
5. Facchinei, F., C. Kanzow. 1997. A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Math. Programming 76 493-512.
6. ____, ____, 1999. Beyond monotonicity in regularization methods for complementarity problems. SIAM J. Control Optim. 37 1150-1161.
7. ____, A. Fischer, C. Kanzow. 2000. On the identification of zero variables in an interior-point framework. SIAM J. Optim. 10 1058-1078.
8. Ferris, M. C., J-S Pang. 1997. Engineering and economic applications of complementarity problem. SIAM Rev. 39 669-713.
9. Fischer, A. 1992. A special Newton-type optimization method. Optimization 24 269-284.
10. ____, 1999. Modified Wilson method for nonlinear programs with nonunique multipliers. Math. Oper. Res. 24 699-727.
11. Fletcher, R. 1987. Practical Methods of Optimization. John Wiley & Sons, New York.
12. Ortega, J. M., W. C. Rheinboldt. 1970 Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.
13. Pang, J-S. 1987 A posteriori error bounds for the linearly-constrained variational inequality problem. Math. Oper. Res. 12 474-484.
14. Robinson, S. M. 1981. Some continuity properties of polyhedral multifunctions. Math. Programming Stud. 14 206-214.
15. Tseng, P. 1996. Growth behavior of a class of merit functions for the nonlinear complementarity problem. J. Optim. Theory and Appl. 89 17-37.
16. Wright, S. J. 2000. Constraint identification and algorithm stabilization for degenerate nonlinear programs. Preprint ANL/MCS-P865-1200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL.
17. Yamashita, N., M. Fukushima. 2001. The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem. SIAM. J. Optim. 11 364-379.
18. ____, H. Dan, ____. 2001. On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm. Technical Report 2001-003, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan.