A new line search method with trust region for unconstrained optimization

Communications on Applied Nonlinear Analysis

Volumn 15, Issue 1, 2008, Pages 35-49

  Yuan, Gonglin ^a,b   Lu, Xiwen ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b GUANGXI UNIVERSITY   (China)

Author keywords

Global convergence; Line search method; Trust region; Unconstrained optimization

Indexed keywords

EID: 40249107806     PISSN: 1074133X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. R. Byrd and J. Nocedal, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM Journal on Numerical Analysis, 26 (1989), 727-739.
2. R. H. Byrd, R. B. Schnabel, and G. A. Schultz, A trust-region algorithm for nonlinearly constrained optimization, SIAM Journal on Numerical Analysis, 24(1987), 1152-1170.
3. Y. Dai, Convergence properties of the BFGS algorithm, SIAM Journal on Optimization, 13(2003), 693-701.
4. Y. Dai, A nonmonotone conjugate gradient algorithm for unconstrained optimization, J. Syst. Sci. Complex., 15(2002), 139-145.
5. Y. Dai and Y. Yuan, A nonlinear conjugate gradient with a strong global convergence properties, SIAM Journal of Optimization, 10(2000), 177-182.
6. J. E. Dennis and R. B. Schnabel, Numerical methods for unconstrained optimization and nonlinear equations, Pretice-Hall, Inc., Englewood Cliffs, NJ, 1983.
7. J. E. Dennis and J. J. Moré, A characteization of superlinear convergence and its application to quasi-Newton methods, Math. Comp., 28 (1974), 549-560.
8. J. E. Dennis Jr., J. J. Moré, Quasi-Newton methods, motivation and theory, SIAM Rev., 19(1977), 46-89.
9. J. Y. Fan, A modified Levenberg-Marquardt algorithm for singular system of nonlinear equations, J. Comput. Math., 21(2003), 625-636.
10. J. H. Fu and W. Y. Sun, Nonmonotone adaptive trust-region method for unconstrained optimization problems, Applied Mathematics and Computation, 163(2005), 489-504.
11. R. Fletcher, Practical Method of Optimization, Vol I: Unconstrained Optimization, 2nd edition, Wiley, New York, 1997.
12. R. Fletcher and C. Reeves, Function minimization bu conjugate gradients, Compute. J., 7(1964), 149-154.
13. A. Griewank and Ph. L. Toint, Local convergence analysis for partitioned quasi-Newton updates. Numer. Math., 39(1992), 429-448.
14. M. R. Hestenes and E. Stiefel, Method Of Conjugate gradient for solving linear equations, J, Res. Nat. Bur. Stand., 49(1952), 409-436.
15. R. Horst, P. M. Pardalos and A. V. Thoai, Introduction to Global Optimization(Kluwer, Dordrecht, 1995).
16. D. Li and M. Fukushima, A modified BFGS method and its global convergence in non-convex minimization, Journal of Computational and Applied Mathematics, 129(2001), 15-35.
17. Y. Liu and C. Storey, Effcient generalized conjugate gradient algorithms, part 1: theory, Journal of optimization theory and Application, 69(1992), 17-41.
18. D. C. Luenerger, Linear and Nonlinear Programming, second editon(Addition Wesley, Reading, MA, 1989).
19. J. J. Moré, B. S. Garbow, and K. E. Hillstrome, Testing unconstrained optimization software, ACM Trans. Math. Software, 7(1981), 17-41.
20. J. Nocedal and S. J. Wright, Numerical Optimization(Spinger, Berlin Heidelberg New York, 1999).
21. E. Polak and G. Ribiere, Note sur la xonvergence de directions conjugees, Rev. Francaise informat Recherche Operatinelle, 3e Annee, 16(1969), 35-43.
22. M. J. D Powell, A new algorithm for unconstrained optimation, In: Nonlinear Programming, J. B. Rosen, O.L.Mangasarian and K.Ritter, eds. Academic Press, New York, 1970.
23. M. Raydan, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem, SIAM J. Optim., 7(1997), 26-33.
24. M. Raydan and B. F. Svaiter, Relaxed steepest descent and Cauchy -Barzilai-Borwein method, Comp. Optim. Appl. 21(2002), 155-167.
25. M. Rojas, S. A. Santos and D. C. Sorensen, A new matrix-free Algorithm for the largescale trust-region subproblem, SIAM J. Optim., Vol.11, No. 3, pp. 611-646.
26. Z. J. Shi, Convergence of line search methods for unconstrained optimization, Applied Mathematics and Computation. 157(2004), 393-405.
27. J. Schropp, A note on minimization problems and multistep methods, Numer. Math., 78(1997), 87-101.
28. J. Schropp, One-step and multistep procedures for constrained minimization problems, IMA J. Numer. Anal., 20(2000), 135-152.
29. G. A. Schultz, R. B. Schnabel, and R. H. Bryrd, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM Journal on Numerical Analysis, 22(1985), 47-67.
30. D. J. Van Wyk, Differential optimization techniques, Appl. Math. Model., 8(1984), 419-424.
31. A. Vardi, A trust-region algorithm for equality constrained minimization: Convergence properties and implementation, SIAM Journal of Numerical Analysis, 22(1985), 575-579.
32. M. N. Vrahatis, G. S. Androulakis, J. N. Lambrinos and G. D. Magolas, A class of gradient unconstrained minimization algorithms with adaptive stepsize, J. Comput. Appl. Math., 114(2000), 367-386.
33. Z. Wei, G. Li, L. Qi, New quasi-Newton methods for unconstrained optimization problems, Applied Mathematics and Computation, 175 (2006), 1156-1188.
34. Z. Wei, G. Yu, G. Yuan and Z. Lian, The superlinear convergence of a modified BFGS-type method for unconstrained optimization, Computational Optimization and Applications, 29 (2004), 315-332.
35. Y. Yuan and W. Sun, Theory and Methods of Optimization, Science Press of China, Beijing, 1999.
36. J. Zhang, N. Deng, and L. Chen, New quasi-Newton equation and related methods for unconstrained optimization, Journal of Optimization Theory and Applications, Vol. 102, No. 1, 1999, pp. 147-167.
37. H. C. Zhang and W. W. Hager A nonmonotone line search technique and its application to unconstrained optimization, SIAM J. Optim., Vol. 14, No. 4, 2004, pp. 1043-1056.