A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization

References

• N. Andrei, An unconstrained optimization test functions collection, Adv. Model. Optim. 10 (2008), pp. 147–161.
   Google Scholar
• N. Andrei, An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization, Numer. Algorithm. 65 (2014), pp. 859–874. doi: 10.1007/s11075-013-9718-7
   Web of Science ®Google Scholar
• J. Barzilai and J.M. Borwein, Two-point step size gradient methods, IMA J. Numer. Anal. 8 (1988), pp. 141–148. doi: 10.1093/imanum/8.1.141
   Web of Science ®Google Scholar
• A. Bouaricha, A software package for large, sparse unconstrained optimization using tensor methods, ACM T. Math. softw. 23 (1997), pp. 81–90. doi: 10.1145/244768.244788
   Web of Science ®Google Scholar
• A. Bouaricha, Tensor methods for large sparse unconstrained optimization, SIAM J. Optim. 7 (1997), pp. 732–756. doi: 10.1137/S1052623494267723
   Web of Science ®Google Scholar
• A. Bouaricha and R.B. Schanabel, Tensor methods for large, sparse nonlinear least squares problems, SIAM J. Sci. Comput. 21 (1999), pp. 1199–1221. doi: 10.1137/S1064827596297549
   Web of Science ®Google Scholar
• T.T. Chow, E. Eskow, and R.B. Schnabel, Algorithm 738: A software package for unconstrained optimization using tensor methods, ACM T. Math. Softw. 20 (1994), pp. 518–530. doi: 10.1145/198429.198438
   Web of Science ®Google Scholar
• Y.H. Dai and C.X. Kou, A nonlinear conjugate gradient algorithm with an optimal property and an improved wolfe line search, SIAM J. Optim. 23 (2013), pp. 296–320. doi: 10.1137/100813026
   Web of Science ®Google Scholar
• Y.H. Dai and C.X. Kou, A Barzilai-Borwein conjugate gradient method, Sci. China Math. 59 (2016), pp. 1511–1524. doi: 10.1007/s11425-016-0279-2
   Web of Science ®Google Scholar
• Y.H. Dai and L.Z. Liao, New conjugacy conditions and related nonlinear conjugate gradient methods, Appl. Math. Optim. 43 (2001), pp. 87–101. doi: 10.1007/s002450010019
   Web of Science ®Google Scholar
• Y.H. Dai and Y. Yuan, A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim. 10 (1999), pp. 177–182. doi: 10.1137/S1052623497318992
   Web of Science ®Google Scholar
• E.D. Dolan and J.J. Mor, Benchmarking optimization software with performance profiles, Math. Programma. 91 (2002), pp. 201–213. doi: 10.1007/s101070100263
   Web of Science ®Google Scholar
• M. Fatemi, A new efficient conjugate gradient method for unconstrained optimization, J. Comput. Appl. Math. 300 (2016), pp. 207–216. doi: 10.1016/j.cam.2015.12.035
   Web of Science ®Google Scholar
• R. Flecher and C.M. Reeves, Function minimization by conjugate gradient method, Comput. J. 7 (1964), pp. 149–154. doi: 10.1093/comjnl/7.2.149
   Web of Science ®Google Scholar
• N.I.M. Gould, D. Orban, and Ph. L. Toint, CUTEst: A constrained and unconstrained testing environment with safe threads for mathematical optimization, Comput. Optim. Appl. 60 (2015), pp. 545–557. doi: 10.1007/s10589-014-9687-3
   Web of Science ®Google Scholar
• W.W. Hager and H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM J. Optim. 16 (2005), pp. 170–192. doi: 10.1137/030601880
   Web of Science ®Google Scholar
• W.W. Hager and H. Zhang, A survey of nonlinear conjugate gradient methods, Pac. J. Optim. 2 (2006), pp. 35–58.
   Google Scholar
• W.W. Hager and H. Zhang, The limited memory conjugate gradient method, SIAM J. Optim. 23 (2013), pp. 2150–2168. doi: 10.1137/120898097
   Web of Science ®Google Scholar
• Q.M. Han, W.Y. Sun, and J.Y. Han, An adaptive conic trust-region method for unconstrained optimization, Optim. Methods. Softw. 20 (2005), pp. 665–677. doi: 10.1080/10556780410001697677
   Web of Science ®Google Scholar
• M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand. 49 (1952), pp. 409–436. doi: 10.6028/jres.049.044
   Google Scholar
• D.Q. Huang, Y.L. Tang, and W.N. Zhang, Distribution of roots of cubic equations, J. Korea Soc. Math. Educ. Ser. B Pure Appl. Math. 17 (2010), pp. 185–188.
   Google Scholar
• L.B. Li, A new algorithm for solving large scale trust region subproblem, Oper. Res. Manag. Sci. 16 (2007), pp. 48–52.
   Google Scholar
• M. Li, H.W. Liu, and Z.X. Liu, A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization, Numer. Algorithm. 79 (2018), pp. 195–219. doi:10.1007/s11075-017-0434-6
   Web of Science ®Google Scholar
• Z.X. Liu and H.W. Liu, An efficient gradient method with approximate optimal stepsize for large scale unconstrained optimization, Numer. Algorithm. 78 (2018), pp. 21–39. doi: 10.1007/s11075-017-0365-2
   Web of Science ®Google Scholar
• E. Polak and G. Ribire, Note sur la convergence de méthods de directions conjuguées, Rev. Franaise Informat. Rech. Opérationnelle. 3 (1969), pp. 35–43.
   Google Scholar
• P. Radosaw, Conjugate Gradient Algorithms in Nonconvex Optimization, Springer-Verlag, Berlin, 2009.
   Google Scholar
• M. Rivaie, M. Mamat, and A. Abashar, A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches, Appl. Math. Comput. 268 (2015), pp. 1152–1163.
   Web of Science ®Google Scholar
• R.B. Schnabel and T.T. Chow, Tensor methods for unconstrained optimization using second derivatives, SIAM J. Optim. 1 (1991), pp. 293–315. doi: 10.1137/0801020
   Web of Science ®Google Scholar
• R.B. Schnabel and P.D. Frank, Tensor methods for nonlinear equations, SIAM J. Numer. Anal. 21 (1984), pp. 815–843. doi: 10.1137/0721054
   Web of Science ®Google Scholar
• X. Shi, L. Yang, and Y. Zhang, A non-monotone tensor method for unconstrained optimization problems, Wseas Trans. Math. 11 (2012), pp. 1006–1017.
   Google Scholar
• Y.T. Yang, Y.T. Chen, and Y.L. Lu, A subspace conjugate gradient algorithm for large-scale unconstrained optimization, Numer. Algorithm. 76 (2017), pp. 813–828. doi: 10.1007/s11075-017-0284-2
   Web of Science ®Google Scholar
• Y. Yuan, A modified BFGS algorithm for unconstrained optimization, IMA J. Numer. Anal. 11 (1991), pp. 325–332. doi: 10.1093/imanum/11.3.325
   Web of Science ®Google Scholar
• Y. Yuan, Subspace methods for large scale nonlinear equations and nonlinear least squares, Optim. Eng. 10 (2009), pp. 207–218. doi: 10.1007/s11081-008-9064-0
   Web of Science ®Google Scholar
• Y. Yuan and J. Stoer, A subspace study on conjugate gradient algorithms, Z. Angew. Math. Mech. 75 (1995), pp. 69–77. doi: 10.1002/zamm.19950750118
   Web of Science ®Google Scholar
• H. Zhang and W.W. Hager, A nonmnotone line search technique and its application to unconstrained optimization, SIAM J. Optim. 14 (2004), pp. 1043–1056. doi: 10.1137/S1052623403428208
   Web of Science ®Google Scholar
• H.W. Liu and Z.X. Liu, An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization, J. Optim. Theory Appl. doi:10.1007/s10957-018-1393-3.
   Web of Science ®Google Scholar