{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T16:49:41Z","timestamp":1775494181185,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11075-017-0362-5","type":"journal-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T06:41:56Z","timestamp":1497422516000},"page":"1273-1282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues"],"prefix":"10.1007","volume":"77","author":[{"given":"Neculai","family":"Andrei","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"362_CR1","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":"362_CR2","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10, 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"key":"362_CR3","first-page":"319","volume":"34","author":"N Andrei","year":"2011","unstructured":"Andrei, N.: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization. Bull. Malays. Math. Sci. Soc. 34, 319\u2013330 (2011)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"362_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0045-7825(76)90056-6","volume":"9","author":"O Axelsson","year":"1976","unstructured":"Axelsson, O.: A class of iterative methods for finite element equations. Comput. Methods Appl. Mech. Eng. 9, 123\u2013137 (1976)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"362_CR5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF01389448","volume":"48","author":"O Axelsson","year":"1986","unstructured":"Axelsson, O., Lindskog, G.: On the rate of convergence of the preconditioned conjugate gradient methods. Numer. Math. 48, 499\u2013523 (1986)","journal-title":"Numer. Math."},{"key":"362_CR6","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.ejor.2013.11.012","volume":"234","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki, S., Ghanbari, R.: The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices. Eur. J. Oper. Res. 234, 625\u2013630 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"362_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L.: CUTEr: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"362_CR8","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H., Kou, C.X.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23, 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"key":"362_CR9","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":"362_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"362_CR11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"362_CR12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"48","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Steifel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. Sec. B 48, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand. Sec. B"},{"key":"362_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/nla.1680010208","volume":"1","author":"IE Kaporin","year":"1994","unstructured":"Kaporin, I.E.: New convergence results and preconditioning strategies for the conjugate gradient methods. Numer. Linear Algebra Appl. 1, 179\u2013210 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"362_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0045-7930(83)90015-4","volume":"11","author":"D Kratzer","year":"1983","unstructured":"Kratzer, D., Parter, S.V., Steuerwalt, M.: Block splittings for the conjugate gradient method. Comput. Fluids 11, 255\u2013279 (1983)","journal-title":"Comput. Fluids"},{"key":"362_CR15","volume-title":"Computer solution of large linear systems. Studies in Mathematics and its Applications, vol 28","author":"G Meurant","year":"1999","unstructured":"Meurant, G.: Computer solution of large linear systems. Studies in Mathematics and its Applications, vol 28. North Holland, Elsevier, Amsterdam (1999)"},{"key":"362_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.cam.2013.02.020","volume":"249","author":"J Pestana","year":"2013","unstructured":"Pestana, J., Wathen, A.J.: On the choice of preconditioner for minimum residual methods for non-Hermitian matrices. J. Comput. Appl. Math. 249, 57\u201368 (2013)","journal-title":"J. Comput. Appl. Math."},{"key":"362_CR17","first-page":"231","volume-title":"Large Sparse Sets of Linear Equations","author":"JK Reid","year":"1971","unstructured":"Reid, J.K.: On the method of conjugate gradients for solution of large sparse systems of linear equations. In: Reid, J.K. (ed.) Large Sparse Sets of Linear Equations, pp 231\u2013254. Academic Press, London (1971)"},{"key":"362_CR18","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/0024-3795(91)90393-B","volume":"154\u2013156","author":"Z Strako\u0161","year":"1991","unstructured":"Strako\u0161, Z.: On the real convergence rate of the conjugate gradient method. Linear Algebra Appl. 154\u2013156, 535\u2013549 (1991)","journal-title":"Linear Algebra Appl."},{"key":"362_CR19","volume-title":"Optimization theory and methods. Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.X.: Optimization theory and methods. Nonlinear Programming. Springer Science + Business Media, New York (2006)"},{"key":"362_CR20","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/BF01389450","volume":"48","author":"A Sluis Van der","year":"1986","unstructured":"Van der Sluis, A., Van der Vorst, H.A.: The rate of convergence of conjugate gradients. Numer. Math. 48, 543\u2013560 (1986)","journal-title":"Numer. Math."},{"key":"362_CR21","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/0717002","volume":"17","author":"R Winther","year":"1980","unstructured":"Winther, R.: Some superlinear convergence results for the conjugate gradient method. SIAM J. Numer. Anal. 17, 14\u201317 (1980)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0362-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0362-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0362-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T07:58:53Z","timestamp":1521878333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0362-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0362-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,14]]}}}