{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T08:53:29Z","timestamp":1769763209663,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T00:00:00Z","timestamp":1486944000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.11171003"],"award-info":[{"award-number":["No.11171003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Education of Jilin Province 12th Five-Year Plan to support scientific research projects","award":["No.2015132"],"award-info":[{"award-number":["No.2015132"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11075-017-0284-2","type":"journal-article","created":{"date-parts":[[2017,2,12]],"date-time":"2017-02-12T23:02:46Z","timestamp":1486940566000},"page":"813-828","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A subspace conjugate gradient algorithm for large-scale unconstrained optimization"],"prefix":"10.1007","volume":"76","author":[{"given":"Yueting","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yuting","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yunlong","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,13]]},"reference":[{"key":"284_CR1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"49","key":"284_CR2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"6","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradient for solving linear systems. J. Res. Natl. Bur. Stand. 6(49), 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"284_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Flether","year":"1964","unstructured":"Flether, R., Reeves, C.M.: Function minimization by conjugate gradient. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"284_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"2000","unstructured":"Dai, Y.H., Yuan, Y.X.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM Journal on Optimization. 10, 177\u2013182 (2000)","journal-title":"SIAM Journal on Optimization."},{"key":"284_CR5","first-page":"149","volume":"7","author":"YL Liu","year":"1964","unstructured":"Liu, Y.L., Storey, C.S.: Efficient generalized conjugate gradient, Part I: Theory. J. Optim. Theory Appl. 7, 149\u2013154 (1964)","journal-title":"J. Optim. Theory Appl."},{"key":"284_CR6","volume-title":"Practical Methods of Optimization, vol. I","author":"R Flecther","year":"1988","unstructured":"Flecther, R.: Practical Methods of Optimization, vol. I. Unconstrained Optimization, Wiley, New York (1988)"},{"issue":"16","key":"284_CR7","first-page":"48","volume":"5","author":"LB Lv","year":"2007","unstructured":"Lv, L.B.: A new algorithm for solving large-scale trust region subproblem. Oper. Res. Manag. Sci. 5(16), 48\u201352 (2007)","journal-title":"Oper. Res. Manag. Sci."},{"issue":"28","key":"284_CR8","first-page":"745","volume":"4","author":"RL Chen","year":"2002","unstructured":"Chen, R.L., Zeng, J.P.: A new subspace correction method for nonlinear unconstrained convex optimization problems. Acta Mathematicae Applicatae Sinica 4(28), 745\u2013756 (2002)","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"284_CR9","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1016\/j.cor.2013.05.013","volume":"40","author":"JK Liu","year":"2013","unstructured":"Liu, J.K.: Convergence properties of a class of nonlinear conjugate gradient methods. Comput. Oper. Res. 40, 2656\u20132661 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"27","key":"284_CR10","first-page":"395","volume":"4","author":"ZH Wang","year":"2005","unstructured":"Wang, Z.H.: A limited memory trust region method for unconstrained optimization and its omplementation. Methematica Numerica Sinica 4(27), 395\u2013404 (2005)","journal-title":"Methematica Numerica Sinica"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Yuan, Y.X.: Subspace Techniques for Nonlinear Optimization. Academy of Mathematics and System Sciences, Chinses Academy of Science (2006)","DOI":"10.1142\/9789812709356_0012"},{"key":"284_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/zamm.19950751207","volume":"75","author":"J Stoer","year":"1995","unstructured":"Stoer, J., Yuan, Y.X.: A subspace study on conjugate gradient algorithms. Zeitschrift for Angewandte Mathematik and Mechanik 75, 69\u201377 (1995)","journal-title":"Zeitschrift for Angewandte Mathematik and Mechanik"},{"key":"284_CR13","unstructured":"Con, A.R., Could, N., Sartenaer, A., Toint, Ph.L.: On Iterated-Subspace Minimization Methods for Nonlinear Optimization. In: Adams, L., Nazareth, J.L. (eds.) Linear and Nonlinear Conjugate Gradient Related Methods, pp 50\u201378. SIAM (1996)"},{"key":"284_CR14","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s11075-013-9718-7","volume":"65","author":"N Andrei","year":"2014","unstructured":"Andrei, N.: An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization. Numerical Algorithms 65, 859\u2013874 (2014)","journal-title":"Numerical Algorithms"},{"key":"284_CR15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.apnum.2015.01.008","volume":"92","author":"SH Deng","year":"2015","unstructured":"Deng, S.H., Wan, Z.: A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems. Appl. Numer. Math. 92, 70\u201381 (2015)","journal-title":"Appl. Numer. Math."},{"key":"284_CR16","first-page":"6316","volume":"219","author":"N Andrei","year":"2013","unstructured":"Andrei, N.: On three-term conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 219, 6316\u20136327 (2013)","journal-title":"Appl. Math. Comput."},{"key":"284_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10957-013-0285-9","volume":"159","author":"N Andrei","year":"2013","unstructured":"Andrei, N.: Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions. J. Optim. Theory Appl. 159, 159\u2013182 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"284_CR18","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1007\/s10957-012-0239-7","volume":"157","author":"SH Deng","year":"2013","unstructured":"Deng, S.H., Wan, Z.: An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems. J. Optim. Theory Appl. 157(3), 820\u2013842 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"284_CR19","first-page":"361","volume":"213","author":"N Andrei","year":"2009","unstructured":"Andrei, N.: Acceleration of conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 213, 361\u2013369 (2009)","journal-title":"Appl. Math. Comput."},{"key":"284_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11075-006-9023-9","volume":"42","author":"N Andrei","year":"2006","unstructured":"Andrei, N.: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numerical Algorithms 42, 63\u201373 (2006)","journal-title":"Numerical Algorithms"},{"key":"284_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cam.2012.10.002","volume":"241","author":"N Andrei","year":"2013","unstructured":"Andrei, N.: A simple three-term conjugate gradient algorithm for unconstrained optimization. J. Comput. Appl. Math. 241, 19\u201329 (2013)","journal-title":"J. Comput. Appl. Math."},{"key":"284_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugate conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"284_CR23","unstructured":"Wang, Z.H., Yuan, Y.X., Wen, Z.W.: A subspace trust region method for large scale unconstrained optimization. Int. Conf. Numer. Linear Algebra Optim. 10 (2003)"},{"key":"284_CR24","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"284_CR25","first-page":"37","volume-title":"Integer and Nonlinear Programming","author":"G Zoutendijk","year":"1970","unstructured":"Zoutendijk, G.: Nonlinear Programming. Computational Method. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp 37\u201386. North-Holland, Amsterdam (1970)"},{"key":"284_CR26","first-page":"1155","volume":"70","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Yuan, Y.X.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 70, 1155\u20131167 (2001)","journal-title":"Ann. Oper. Res."},{"key":"284_CR27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0284-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0284-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0284-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T11:56:46Z","timestamp":1568807806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0284-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,13]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0284-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,13]]}}}