Flexible complementarity solvers for large-scale applications

Optimization Methods and Software

Volumn 21, Issue 1, 2006, Pages 155-168

  Benson, Steven J ^a   Munson, Todd S ^a  

^a ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Complementarity; Semismooth methods; Software design

Indexed keywords

LINEAR PROGRAMMING; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; NUMERICAL ANALYSIS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SET THEORY;

COMPLEMENTARITY; INFINITE-DIMENSIONAL VARIATIONAL INEQUALITIES; SEMISMOOTH METHODS; SOFTWARE DESIGN;

LARGE SCALE SYSTEMS;

EID: 29644447899     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500065382     Document Type: Article

References (34)

1. Harker, P.T. and Pang, J.S., 1990, Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications. Mathematical Programming, 48, 161-220.
2. Ferris, M.C. and Pang, J.S., 1997, Engineering and economic applications of complementarity problems. SIAM Review, 39, 669-713.
3. Ekeland, I. and Témam, R., 1976, Convex Analysis and Variational Problems (North-Holland, Amsterdam).
4. Kinderlehrer, D. and Stampacchia, G., 1980, An Introduction to Variational Inequalities and Their Applications (New York: Academic Press).
5. Averick, B.M., Carter, R.G., Moré, J.J. and Xue, G.L., 1992, The M1NPACK-2 test problem collection. Technical Report MCS-P153-0692, Argonne National Laboratory, Argonne, Illinois.
6. Huang, J. and Pang, J.S., 1998, Option pricing and linear complementarity. Journal of Computational Finance, 2, 31-60.
7. Wilmott, P., Dewynne, J. and Howison, S., 1993, Option Pricing (Oxford, England: Oxford Financial Press).
8. Rodrigues, J.F., 1987, Obstacle Problems in Mathematical Physics (Amsterdam: Elsevier Publishing Company).
9. Ulbrich, M. On a nonsmooth Newton method for nonlinear complementarity problems in function space with applications in optimal control. In: M.C. Ferris, O.L. Mangasarian and J.S. Pang (Eds) Complementarity: Applications, Algorithms and Extensions, Vol. 50 of Applied Optimization, Dordrecht, The Netherlands, 2001 (Kluwer Academic Publishers), pp. 341-360.
10. Benson, S., Curfman-McInnes, L. and Moré, J., 2000, TAO users manual. Technical Report ANL/MCS-TM-242, Mathematics and Computer Science Division, Argonne National Laboratory. Available online at: http://www.mcs.anl. gov/tao.
11. Balay, S., Gropp, W., Curfman-McInnes, L., and Smith, B., PETSc web page. Available online at: http://www.mcs.anl.gov/petsc.
12. Hypre: High performance preconditioners. Available online at: http://www.llnl.gov/CASC/hypre/.
13. Mike Heroux et al. Trilinos web page. Available online at: http://software.sandia.gov/trilinos
14. Benson, S., Curfman-McInnes, L. and Moré, J. Toolkit for advanced optimization (TAO) web page. Available online at: http://www.mcs.anl.gov/tao.
15. De Luca, T., Facchinei, F. and Kanzow, C., 1996, A semismooth equation approach to the solution of nonlinear complementarity problems. Mathematical Programming, 75, 407-439.
16. Munson, T.S., Facchinei, F., Ferris, M.C., Fischer, A. and Kanzow, C., 2001, The semismooth algorithm for large scale complementarity problems. INFORMS Journal on Computing, 13, 294-311.
17. Dirkse, S.P. and Ferris, M.C., 1997, Crash techniques for large-scale complementarity problems. In: M. C. Ferris and J. S. Pang (Eds) Complementarity and Variational Problems: State of the Art (Philadelphia: SIAM), pp. 40-61.
18. Facchinei, F. and Soares, J., 1997, A new merit function for nonlinear complementarity problems and a related algorithm. SIAM Journal on Optimization, 7, 225-247.
19. Saad, Y., 1996, Iterative Methods for Sparse Linear Systems (Boston: PWS Publishing Company).
20. Dirkse, S.P. and Ferris, M.C., 1995, MCPLIB: A collection of nonlinear mixed complementarity problems. Optimization Methods and Software, 5, 319-345.
21. Benson, S., Curfman-McInnes, L. and Moré, J., 2001, A case study in the performance and scalability of optimization algorithms. ACM Transactions on Mathematical Software, 27(3), 361-376.
22. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., DuCros, J., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S. and Sorensen, D. 1995, LAPACK User's Guide (2nd edn) (Philadelphia: SIAM).
23. Murtagh, B.A. and Saunders, M.A., MINOS 5.0 user's guide. Technical Report SOL 83.20, Stanford University, Stanford, California, 1983.
24. Saad, Y. and Schultz, M., 1986, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 44, 856-869.
25. Golub, G.H. and van Loan, C.F., 1996, Matrix Computations (3rd edn) (Baltimore, Maryland: The John Hopkins University Press).
26. Balay, S., Gropp, W.D., Curfman-McInnes, L. and Smith, B.F., 1997, Efficient management of parallelism in object oriented numerical software libraries. In: E. Arge, A.M. Bruaset and H.P. Langtangen (Eds) Modern Software Tools in Scientific Computing (Birkhauser Press), pp. 162-202.
27. Balay, S., Gropp, W.D., Curfman-McInnes, L. and Smith, B.F., 2001, PETSc 2.0 users manual. Technical Report ANL-95/11 -Revision 2.1.0, Argonne National Laboratory, 2001.
28. Gropp, W., Lusk, E. and Skjellum, A., 1994, Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press.
29. Fischer, A., 1992, A special Newton-type optimization method. Optimization, 24, 269-284.
30. Qi, L., 1993, Convergence analysis of some algorithms for solving nonsmooth equations. Mathematics of Operations Research, 18, 227-244.
31. Armijo, L. 1966, Minimization of functions having Lipschitz-continuous first partial derivatives. Pacific Journal of Mathematics, 16, 1-3.
32. Billups, S.C., 1995, Algorithms for complementarity problems and generalized equations. PhD thesis, University of Wisconsin, Madison.
33. Dirkse, S.P. and Ferris, M.C., 1995, The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software, 5, 123-156.
34. Moré, J.J. and Toraldo, G., 1991, On the solution of large quadratic programming problems with bound constraints. SIAM Journal on Optimization, 1, 93-113.