A subspace implementation of quasi-Newton trust region methods for unconstrained optimization

Numerische Mathematik

Volumn 104, Issue 2, 2006, Pages 241-269

  Wang, Zhou Hong ^a,b   Yuan, Ya Xiang ^a  

^a INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748852443     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00211-006-0021-6     Document Type: Article

References (31)

1. Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L.: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123-160 (1995)
2. Byrd, R., Schnabel, R.B., Shultz, G.A.: Approximation solution of the trust region problem by minimization over two-dimensional subspaces. Math. Prog. 40, 247-263 (1988)
3. Conn, A.R., Gould, N.I.M., Sartenaer, A., Toint, Ph.L.: On the iterated-subspace minimization methods for nonlinear optimization with a combination of general equality and linear constraints. In: Adams, L., Nazareth, J.L. (eds.) Proceedings on Linear and Nonlinear Conjugate Gradient-Related Methods, pp. 50-78. SIAM (1996)
4. Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comput. 50, 399-430 (1988)
5. Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. SIAM Publications, Philadelphia, Pennsylvania (2000)
6. Daniel, W., Gragg, W.B., Kaufman, L., Stewart, G.W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comput. 30, 772-795 (1976)
7. Dennis, J.E., Mei, H.H.W.: Two new unconstrained optimization algorithms which use function and gradient values. J. Optim. Appl. 28, 453-482 (1979)
8. Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, NJ (1983)
9. Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Prog. 91, 201-213 (2002)
10. Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, New York (1987)
11. Gay, D.M.: Computing optimal locally constrained steps. SIAM J. Sci. Stat. Comput. 2, 186-197 (1981)
12. Gill, P.E., Leonard, M.W.: Reduced-Hessian quasi-Newton methods for unconstrained optimization. SIAM J. Optim. 12, 209-237 (2001)
13. Golub, G.H., Van Loan, C.F.: Matrix Computations. 3rd edn. Johns Hopkins University Press, Baltimore (1996)
14. Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373-394 (2003)
15. Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Prog. 45, 503-528 (1989)
16. Moré, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553-572 (1983)
17. Nocedal, J., Yuan. Y.: Combining trust region and line search techniques. In: Yuan, Y. (ed.) Advances in Nonlinear Programming, Proceedings of the 1996 International Conference on Nonlinear Programming, pp. 153-176, Kluwer, Dordrecht (1998)
18. Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K.(eds.) Nonlinear Programming, pp. 31-66. Academic, New York (1970)
19. Powell, M.J.D.: A hybrid method for nonlinear equations. In: Robinowitz, P. (ed.) Numerical Methods for Nonlinear Algebraic Equations, pp. 87-144. Gordon and Breach Science, London (1970)
20. Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson S.M. (eds.) Nonlinear Programming, 2, pp. 1-27. Academic, New York (1975)
21. Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained minimization. Math. Prog. 29, 297-303 (1984)
22. Siegel, D.: Implementing and modifying Broyden class updates for large scale optimization. Report DAMPT 1992/NA12, University of Cambridge, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, England (1992)
23. Siegel, D.: Modifying the BFGS update by a new column scaling technique. Math. Prog. 66, 45-78 (1994)
24. Sorensen, D.C.: Newton's method with a model trust region modifications. SIAM J. Numer. Anal. 19, 409-426 (1982)
25. Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626-637 (1983)
26. Stewart, G.W.: Matrix Algorithms. Volume 1: Basic Decompostions. SIAM, Philadelphia, PA (1998)
27. Stoer, J., Yuan, Y.: A subspace study on conjugate gradient algorithms. ZAMM Z. Angew. Math. Mech. 75, 69-77 (1995)
28. Vlc̃ek, J., Luks̃an, L.: New variable metric methods for unconstrained minimization covering the large-scale case. Technical Report No. V876, October 2002, Institute of Computer Science, Academy of Sciences of the Czech Republic (2002)
29. Yuan, Y.: Numerical Methods for Nonlinear Optimization. Shanghai Science and Technology Press, Shanghai (1994)
30. Yuan, Y.: A review of trust region algorithms for optimization. In: Ball, J.M., Hunt, J.C.R. (eds.) ICM99: Proceedings of the Fourth International Congress on Industrial and Applied Mathematics, pp. 271-282. Oxford University Press, Oxford (2000)
31. Yuan, Y.: On the truncated conjugate gradient method. Math. Prog. 87, 561-571 (2000)