GALAHAD, a library of thread-safe fortran 90 packages for large-scale nonlinear optimization

ACM Transactions on Mathematical Software

Volumn 29, Issue 4, 2003, Pages 353-372

  Gould, Nicholas I M ^a   Orban, Dominique ^b   Toint, Philippe L ^c  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b NORTHWESTERN UNIVERSITY   (United States)

^c UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Fortran 90; GALAHAD; LANCELOT; Large scale nonlinear optimization; Large scale quadratic programming

Indexed keywords

FORTRAN 90; GALAHAD; LANCELOT; LARGE-SCALE NONLINEAR OPTIMIZATION; LARGE-SCALE QUADRATIC PROGRAMMING;

ALGORITHMS; CODES (STANDARDS); COMPUTER PROGRAMMING; COMPUTER SOFTWARE; LAGRANGE MULTIPLIERS; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 2442619389     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/962437.962438     Document Type: Article

References (34)

1. BENSON, H., SHANNO, D. F., AND VANDERBEI, R. J. 2001. A comparative study of large-scale nonlinear optimization algorithms. Tech. Rep. ORFE 01-04, Operations Research and Financial Engineering, Princeton University, New Jersey.
2. BISCHOF, CHR., CARLE, A., CORLISS, G., GRIEWANK, A., AND HOVLAND, P. 1992. ADIFOR - generating derivative codes from Fortran programs. Scientific Programming 1, 1-29.
3. BONGARTZ, I., CONN, A. R., GOULD, N. I. M., AND TOINT, PH. L. 1995. CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Soft. 21, 1, 123-160.
4. BYRD, R. H., HRIBAR, M. E., AND NOCEDAL, J. 1999. An interior point algorithm for large scale nonlinear programming. SIAM J. Optimization 9, 4, 877-900.
5. CHIN, C. M. 2001. Numerical results of SLPSQP, filterSQP and LANCELOT on selected CUTE test problems. Numerical Analysis Report NA/203, Department of Mathematics, University of Dundee, Scotland.
6. CONN, A. R., GOULD, N. I. M., AND TOINT, PH. L. 1992. LANCELOT: a Fortran package for Large-scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics. Springer Verlag, Heidelberg, Berlin, New York.
7. CONN, A. R., GOULD, N. I. M., AND TOINT, PH. L. 1996a. Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Mathematical Programming, Series A 73, 1, 73-110.
8. CONN, A. R., GOULD, N. I. M., AND TOINT, PH. L. 2000a. Trust-Region Methods. SIAM, Philadelphia.
9. CONN, A. R., GOULD, N. I. M., ORBAN, D., AND TOINT, PH. L. 2000b. A primal-dual trust-region algorithm for non-convex nonlinear programming. Mathematical Programming 87, 2, 215-249.
10. CONN, A. R., GOULD, N. I. M., SARTENAER, A., AND TOINT, PH. L. 1996b. Convergence properties of minimization algorithms for convex constraints using a structured trust region. SIAM J. Optimization 6, 4, 1059-1086.
11. CZYZYK, J., MESNIER, M. P., AND MORÉ, J. J. 1998. The NEOS Server. IEEE J. Computational Sci. Engin. B, 68-75.
12. DOLAN, E. D. AND MORÉ, J. J. 2000. Benchmarking optimization software with COPS. Tech. Rep. ANL/MCS-246, Argonne National Laboratory, Illinois, USA.
13. DOLAN, E. D. AND MORÉ, J. J. 2002. Benchmarking optimization software with performance profiles. Math. Program. 91, 2, 201-213.
14. DUFF, I. S. 2002. MA57 - a new code for the solution of sparse symmetric definite and indefinite systems. Tech. Rep. RAL-TR-2002-024, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England.
15. DUFF, I. S. AND REID, J. K. 1982. MA27: A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Report R-10533, AERE Harwell Laboratory, Harwell, UK.
16. FLETCHER, R. AND LEYFFER, S. 2002. Nonlinear programming without a penalty function. Math. Program. 91, 2, 239-269.
17. FOURER, R., GAY, D. M., AND KERNIGHAN, B. W. 2003. AMPL: A Modeling Language for Mathematical Programming, (2nd. edn.). Brooks/Cole-Thompson Learning, Pacific Grove, California, USA.
18. GILL, P. E., MURRAY, W., AND SAUNDERS, M. A. 2002. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM J. Optimization, 12, 4, 979-1006.
19. GOULD, N. I. M. AND TOINT, PH. L. 2002a. Numerical methods for large-scale non-convex quadratic programming. In Trends in Industrial and Applied Mathematics (A. H. Siddiqi and M. Kočvara, eds.). Kluwer Academic Publishers, Dordrecht, The Netherlands, 149-179.
20. GOULD, N. I. M. AND TOINT, PH. L. 2002b. Preprocessing for quadratic programming. Tech. Rep. RAL-TR-2002-001, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England.
21. GOULD, N. I. M., HRIBAR, M. E., AND NOCEDAL, J. 2001. On the solution of equality constrained quadratic problems arising in optimization. SIAM J. Sci. Comput. 23, 4, 1375-1394.
22. GOULD, N. I. M., LUCIDI, S., ROMA, M., AND TOINT, PH. L. 1999a. Solving the trust-region subproblem using the Lanczos method. SIAM J. on Optimization 9, 2, 504-525.
23. GOULD, N. I. M., ORBAN, D., AND TOINT, PH. L. 2002a. CUTEr (and SifDec), a constrained and unconstrained testing environment, revisited, Tech. Rep. RAL-TR-2002-009, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England.
24. GOULD, N. I. M., ORBAN, D., AND TOINT, PH. L. 2002b. Results from a numerical evaluation of LANCELOT B. Numerical Analysis Group Internal Report 2002-1, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England.
25. GOULD, N. I. M., ORBAN, D., SARTENAER, A., AND TOINT, PH. L. 1999b. Superlinear convergence of primal-dual interior-point algorithms for nonlinear programming. SIAM J. on Optimization 11, 4, 974-1002.
26. HOCK, W. AND SCHITTKOWSKI, K. 1981. Test Examples for Nonlinear Programming Codes. Number 187 In 'Lecture Notes in Economics and Mathematical Systems'. Springer Verlag, Heidelberg, Berlin, New York.
27. HSL. 2002. A collection of Fortran codes for large-scale scientific computation. See http://www.cse.clrc.ac.uk/Activity/HSL.
28. LIN, C. AND MORÉ, J. J. 1999a. Incomplete Cholesky factorizations with limited memory. SIAM J. Sci. Comput. 21, 1, 24-45.
29. LIN, C. AND MORÉ, J. J. 1999b. Newton's method for large bound-constrained optimization problems. SIAM J. Optimization, 9, 4, 1100-1127.
30. MORÉ, J. J. AND TORALDO, G. 1991. On the solution of large quadratic programming problems with bound constraints. SIAM J. Optimization, 1, 1, 93-113.
31. PRYCE, J. D. AND REID, J. K. 1998. AD01, a Fortran 90 code for automatic differentiation. Tech. Rep. RAL-TR-1998-057, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England.
32. TOINT, PH. L. 1997. A non-monotone trust-region algorithm for nonlinear optimization subject to convex constraints. Math. Program. 77, 1, 69-94.
33. VANDERBEI, R. J. AND SHANNO, D. F. 1999. An interior point algorithm for nonconvex nonlinear programming. Computational Optimization and Applications 13, 231-252.
34. ZHANG, Y. 1994. On the convergence of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optimization, 4, 1, 208-227.