References
- Dembo RS, Steihaug T. Truncated-Newton algorithms for large-scale unconstrained optimization. Math Program. 1983;26:190–212. doi: 10.1007/BF02592055
- Nash SG. A survey of truncated-Newton methods. J Comput Appl Math. 2000;124:45–59. doi: 10.1016/S0377-0427(00)00426-X
- Liu DC, Nocedal J. On the limited memory BFGS method for large-scale optimization. Math Program. 1989;45:503–528. doi: 10.1007/BF01589116
- Xiao Y, Wei Z, Wang Z. A limited memory BFGS-type method for large-scale unconstrained optimization. Comput Math Appl. 2008;56(4) 1001–1009. doi: 10.1016/j.camwa.2008.01.028
- Nocedal J. Updating quasi-Newton matrices with limited storage. Math Comput. 1980;35:773–782. doi: 10.1090/S0025-5718-1980-0572855-7
- Hager WW, Zhang H. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim. 2005;16:170–192. doi: 10.1137/030601880
- Liu JK, Li SJ. New three-term conjugate gradient method with guaranteed global convergence. Int J Comput Math. 2014;91:1744–1754. doi: 10.1080/00207160.2013.862236
- Qingying S, Qiu L. Global convergence of modified HS conjugate gradient method. J Appl Math Comput. 2006;22:289–297. doi: 10.1007/BF02832054
- Zhang L, Zhou W, Li DH. A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence. IMA J Numer Anal. 2006;26:629–640. doi: 10.1093/imanum/drl016
- Zhang L, Zhou W, Li DH. Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search. Numer Math. 2006;104:561–572. doi: 10.1007/s00211-006-0028-z
- Birgin EG, Evtushenko YG. Automatic differentiation and spectral projected gradient methods for optimal control problems. Optim Methods Softw. 1998;10:125–146. doi: 10.1080/10556789808805707
- Raydan M. On the Barzilai and Borwein choice of steplength for the gradient method. IMA J Numer Anal. 1993;13:321–326. doi: 10.1093/imanum/13.3.321
- Yuan Y.-X., Stoer J. A subspace study on conjugate gradient algorithms. ZAMM–J Appl Math Mech. 1995;75:69–77. doi: 10.1002/zamm.19950750118
- Yuan YX. Subspace techniques for nonlinear optimization. Talk presented at the International Conference on High Performance Scientific Computing; Hanoi, Vietnam; 2006 Mar 6–10.
- El-Gindy TM, Salim MS, Ahmed AI. A modified partial quadratic interpolation method for unconstrained optimization. J Concr Appl Math. 2013;11:136–146.
- Salim MS, Ahmed AI. A quasi-Newton augmented Lagrangian algorithm for constrained optimization problems. J Intell Fuzzy Syst. 2018. DOI:10.3233/JIFS-17899.
- Fletcher R, Powell MJD. A rapidly convergent descent method for minimization. Comput J. 1963;6:163–168. doi: 10.1093/comjnl/6.2.163
- Davidon WC. Variable metric method of minimization. Argonne (IL): Argonne National Laboratory; 1959. (Report ANL-5990).
- Fletcher R. A new approach to variable metric algorithms. Comput J. 1970;13:317–322. doi: 10.1093/comjnl/13.3.317
- Shanno DF. Conditioning of quasi-Newton methods for function minimization. Math Comput. 1970;24:647–656. doi: 10.1090/S0025-5718-1970-0274029-X
- Liu L, Wei Z, Wu X. The convergance of a new modified BFGS method without line searchs for unconstrained optimization or complexity systems. J Syst Sci Complex. 2010;23:861–872. doi: 10.1007/s11424-010-7180-3
- Moré JJ, Garbow BS, Hillstrome KE. Testing unconstrained optimization software. ACM Trans Math Softw. 1981;7:17–41. doi: 10.1145/355934.355936