On the solution of bounded and unbounded mixed complementarity problems

Optimization

Volumn 50, Issue 3-4, 2001, Pages 265-278

  Andreani, Roberto ^a   Martínez, José Mario ^b  

^a SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Box constrained minimization; Mixed complementarity problem; Reformulation; Variational inequalities

Indexed keywords

EID: 0009969308     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331930108844563     Document Type: Article

References (25)

1. Andreani, R., Friedlander, A. and Martínez, J. M. (1997). On the solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, Journal on Optimization Theory and Applications, 94, 635-657.
2. Andreani, R. and Martínez, J. M. (1998). Solving complementarity problems by means of a new smooth constrained nonlinear solver, In: Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, edited by Fukushima, M. and Qi, L., Kluwer, pp. 1-24.
3. Andreani, R. and Martínez, J. M. (1993). On the solution of the extended linear complementarity problem, Linear Algebra and its Applications, 281, 247-257.
4. Andreani, R. and Martínez, J. M. (1999). On the reformulation of non-linear complementarity problems using the Fischer-Burmeister function, Applied Mathematics Letters, 12, 7-12.
5. Chen, B., Chen, X., and Kanzow, C. (1997). A penalized Fischer-Burmeister NCP-function: theoretical investigation and numerical results, presented at the International Symposium on Mathematical Programming in Lausanne, Switzerland, 24-29 August, 1997.
6. Conn, A. R., Gould, N. I. M. and Toint, Ph. L. (1988). Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM Journal on Numerical Analysis, 25, 433-460.
7. See also SIAM Journal on Numerical Analysis, 26, 764-767 (1989).
8. Cottle, R. W., Pang, J. S. and Stone, R. E. (1992). The Linear Complementarity Problem, Academic Press, New York.
9. Dirkse, S. P. and Ferris, M. C. (1995). A collection of nonlinear mixed complementarity problems, Optimization Methods and Software, 5, 319-345.
10. Facchinei, F., Fischer, A. and Kanzow, C. (1997). A semismooth Newton method for variational inequalities: the case of box constraints, In: Complementarity and variational problems: state of the art, edited by Ferris, M. C. and Pang, J. S., SIAM, Philadelphia, pp. 76-90.
11. Ferris, M. C. and Kanzow, C. (1998). Complementarity and related problems: a survey, Technical Report, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin.
12. Ferris, M. C., Kanzow, C. and Munson, T. S. (1998). Feasible descent algorithms for mixed complementarity problems, Mathematical Programming Technical Report 98-04, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin.
13. Friedlander, A., Martínez, J. M. and Santos, S. A. (1994). A new trust region algorithm for bound constrained minimization, Applied Mathematics and Optimization, 30, 235-266.
14. Friedlander, A., Martínez, J. M. and Santos, S. A. (1994). On the resolution of large scale linearly constrained convex minimization problems, SIAM Journal on Optimization, 4, 331-339.
15. Friedlander, A., Martínez, J. M. and Santos, S. A. (1995). Solution of linear complementarity problems using minimization with simple bounds, Journal of Global Optimization, 6, 253-267.
16. Friedlander, A., Martínez, J. M. and Santos, S. A. (1995). A new strategy for solving variational inequalities on bounded polytopes, Numerical Functional Analysis and Optimization, 16, 653-668.
17. Geiger, C. and Kanzow, C. (1996). On the resolution of monotone complementarity problems, Computational Optimization and Applications, 5, 155-173.
18. Gowda, M. S. (1996). On the extended linear complementarity problem, Mathematical Programming, 72, 33-50.
19. Harker, P. T. and Pang, J. S. (1990). Finite-dimensional variational inequality and nonlinear complementarity problem: a survey of theory, algorithms and applications, Mathematical Programming, 48, 161-220.
20. Kanzow, C. (1997). A new approach to continuation methods for complementarity problems with uniform P-functions, Operations Research Letters, 20, 85-92.
21. Kanzow, C., Yamashita, N. and Fukushima, M. (1997). New NCP-functions and properties, Journal of Optimization Theory and Applications, 94, 115-135.
22. Júdice, J. J. (1994). Algorithms for linear complementarity problems, Algorithms for Continuous Optimization, edited by Spedicato, E., Kluwer, pp. 435-474.
23. Mangasarian, O. L. and Pang, J. S. (1995). The extended linear complementarity problem, SIAM Journal on Matrix Analysis and Applications, 16, 359-368.
24. Mangasarian, O. L. and Solodov, M. V. (1993). Nonlinear complementarity problem as unconstrained and constrained minimization, Mathematical Programming, 62, 277-297.
25. Solodov, M. (1999). Some optimization reformulations of the extended linear complementarity problem, Computational Optimization and Applications, 13, 187-200.