{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:17:15Z","timestamp":1759191435844,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,7,9]],"date-time":"2016-07-09T00:00:00Z","timestamp":1468022400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s11590-016-1060-2","type":"journal-article","created":{"date-parts":[[2016,7,9]],"date-time":"2016-07-09T14:22:59Z","timestamp":1468074179000},"page":"835-853","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Novel preconditioners based on quasi\u2013Newton updates for nonlinear conjugate gradient methods"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0402-8732","authenticated-orcid":false,"given":"Caliciotti","family":"Andrea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4721-8114","authenticated-orcid":false,"given":"Fasano","family":"Giovanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9858-3616","authenticated-orcid":false,"given":"Roma","family":"Massimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,9]]},"reference":[{"key":"1060_CR1","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1080\/10556780600822260","volume":"22","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Optim. Methods Softw. 22, 561\u2013571 (2007)","journal-title":"Optim. Methods Softw."},{"key":"1060_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02591943","volume":"27","author":"B Buckley","year":"1983","unstructured":"Buckley, B., Lenir, A.: QN-like variable storage conjugate gradients. Math. Program. 27, 155\u2013175 (1983)","journal-title":"Math. Program."},{"key":"1060_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y Dai","year":"1999","unstructured":"Dai, Y., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"1060_CR4","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"J Dennis","year":"1993","unstructured":"Dennis, J., Wolkowicz, H.: Sizing and least-change secant methods. SIAM J. Numer. Anal. 30, 1291\u20131314 (1993)","journal-title":"SIAM J. Numer. Anal."},{"key":"1060_CR5","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.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1060_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10589-007-9034-z","volume":"38","author":"G Fasano","year":"2007","unstructured":"Fasano, G., Roma, M.: Iterative computation of negative curvature directions in large scale optimization. Comput. Optim. Appl. 38, 81\u2013104 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"1060_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10589-013-9563-6","volume":"56","author":"G Fasano","year":"2013","unstructured":"Fasano, G., Roma, M.: Preconditioning Newton\u2013Krylov methods in nonconvex large scale optimization. Comput. Optim. Appl. 56, 253\u2013290 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"1060_CR8","doi-asserted-by":"publisher","unstructured":"Fasano, G., Roma, M.: A novel class of approximate inverse preconditioners for large positive definite systems. Comput. Optim. Appl. Online first (2015). doi: 10.1007\/s10589-015-9765-1","DOI":"10.1007\/s10589-015-9765-1"},{"key":"1060_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"1060_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J Gilbert","year":"1992","unstructured":"Gilbert, J., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"1060_CR11","volume-title":"Matrix Computations","author":"G Golub","year":"1996","unstructured":"Golub, G., Van Loan, C.: Matrix Computations, 3rd edn. The John Hopkins Press, Baltimore (1996)","edition":"3"},{"key":"1060_CR12","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1060_CR13","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/08074008","volume":"21","author":"S Gratton","year":"2011","unstructured":"Gratton, S., Sartenaer, A., Tshimanga, J.: On a class of limited memory preconditioners for large scale linear systems with multiple right-hand sides. SIAM J. Optim. 21, 912\u2013935 (2011)","journal-title":"SIAM J. Optim."},{"key":"1060_CR14","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W Hager","year":"2005","unstructured":"Hager, 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":"1060_CR15","first-page":"35","volume":"2","author":"W Hager","year":"2006","unstructured":"Hager, W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"1060_CR16","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"W Hager","year":"2013","unstructured":"Hager, W., Zhang, H.: The limited memory conjugate gradient method. SIAM J. Optim. 23, 2150\u20132168 (2013)","journal-title":"SIAM J. Optim."},{"key":"1060_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M Hestenes","year":"1952","unstructured":"Hestenes, M., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1060_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D Liu","year":"1989","unstructured":"Liu, D., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"1060_CR19","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1137\/S1052623497327854","volume":"10","author":"J Morales","year":"2000","unstructured":"Morales, J., Nocedal, J.: Automatic preconditioning by limited memory quasi-Newton updating. SIAM J. Optim. 10, 1079\u20131096 (2000)","journal-title":"SIAM J. Optim."},{"key":"1060_CR20","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"J Mor\u00e9","year":"1994","unstructured":"Mor\u00e9, J., Thuente, D.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. (TOMS) 20, 286\u2013307 (1994)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"1060_CR21","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1137\/0716059","volume":"16","author":"L Nazareth","year":"1979","unstructured":"Nazareth, L.: A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms. SIAM J. Numer. Anal. 16, 794\u2013800 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"1060_CR22","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"1060_CR23","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)"},{"issue":"1","key":"1060_CR24","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribiere, G.: Note sur la convergence de methodes de directions conjuguees. Revue Francaise d\u2019Informatique et de Recherche Operationnelle, serie rouge, tome 3(1), 35\u201343 (1969)","journal-title":"Revue Francaise d\u2019Informatique et de Recherche Operationnelle, serie rouge, tome"},{"key":"1060_CR25","volume-title":"Conjugate Gradient Algorithms in Nonconvex Optimization","author":"R Pytlak","year":"2009","unstructured":"Pytlak, R.: Conjugate Gradient Algorithms in Nonconvex Optimization. Springer, Berlin (2009)"},{"key":"1060_CR26","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"D Shanno","year":"1978","unstructured":"Shanno, D.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 244\u2013256 (1978)","journal-title":"Math. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1060-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1060-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1060-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1060-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:08:32Z","timestamp":1498313312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1060-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,9]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1060"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1060-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,7,9]]}}}