{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T04:52:16Z","timestamp":1656996736202},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10957-014-0600-0","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T15:27:26Z","timestamp":1405351646000},"page":"883-914","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Framework of Conjugate Direction Methods for Symmetric Linear Systems in Optimization"],"prefix":"10.1007","volume":"164","author":[{"given":"Giovanni","family":"Fasano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"600_CR1","volume-title":"Iterative Solution Methods","author":"O Axelsson","year":"1996","unstructured":"Axelsson, O.: Iterative Solution Methods. Cambridge University Press, Cambridge (1996)"},{"key":"600_CR2","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The John Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"600_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"600_CR4","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"1996","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (1996)"},{"key":"600_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-0427(00)00412-X","volume":"123","author":"Y Saad","year":"2000","unstructured":"Saad, Y., Van Der Vorst, H.A.: Iterative solution of linear systems in the twentieth century. J. Comput. Appl. Math. 123, 1\u201333 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"600_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0613011","volume":"13","author":"A Greenbaum","year":"1992","unstructured":"Greenbaum, A., Strakos, Z.: Predicting the behavior of finite precision Lanczos and conjugate gradient computations. SIAM J. Matrix Anal. Appl. 13, 121\u2013137 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"600_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970937","volume-title":"Iterative Methods for Solving Linear Systems","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative Methods for Solving Linear Systems, vol. SIAM. SIAM, Philadelphia (1997)"},{"key":"600_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6048-6","volume-title":"Conjugate Direction Methods in Optimization","author":"MR Hestenes","year":"1980","unstructured":"Hestenes, M.R.: Conjugate Direction Methods in Optimization. Springer, New York (1980)"},{"key":"600_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0377-0427(00)00426-X","volume":"124","author":"SG Nash","year":"2000","unstructured":"Nash, S.G.: A survey of truncated-Newton methods. J. Comput. Appl. Math. 124, 45\u201359 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"600_CR10","volume-title":"Trust Region Methods. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"600_CR11","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10957-005-2087-1","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar-conjugate gradient algorithm for large scale unconstrained optimization. Part 2: Application. J. Optim. Theory Appl. 125, 523\u2013541 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"600_CR12","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone linesearch for unconstrained optimization. J. Optim. Theory Appl. 60, 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"600_CR13","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1137\/S1052623497327854","volume":"10","author":"JL Morales","year":"2000","unstructured":"Morales, J.L., Nocedal, J.: Automatic preconditioning by limited memory quasi-Newton updating. SIAM J. Optim. 10, 1079\u20131096 (2000)","journal-title":"SIAM J. Optim."},{"key":"600_CR14","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013435 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"600_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10957-006-9119-3","volume":"132","author":"G Fasano","year":"2007","unstructured":"Fasano, G.: Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems. J. Optim. Theory Appl. 132, 267\u2013285 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"600_CR16","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/978-3-642-68874-4_21","volume-title":"Mathematical Programming. The State of the Art","author":"J Stoer","year":"1983","unstructured":"Stoer, J.: Solution of large linear systems of equations by conjugate gradient type methods. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming. The State of the Art, pp. 540\u2013565. Springer, Berlin (1983)"},{"key":"600_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(90)90065-D","volume":"9","author":"SG Nash","year":"1990","unstructured":"Nash, S.G., Sofer, A.: Assessing a search direction within a truncated Newton method. Oper. Res. Lett. 9, 219\u2013221 (1990)","journal-title":"Oper. Res. Lett."},{"key":"600_CR18","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":"600_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/10556780008805794","volume":"14","author":"NIM Gould","year":"2000","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, PhL: Exploiting negative curvature directions in linesearch methods for unconstrained optimization. Optim. Methods Softw. 14, 75\u201398 (2000)","journal-title":"Optim. Methods Softw."},{"key":"600_CR20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s11590-009-0132-y","volume":"3","author":"G Fasano","year":"2009","unstructured":"Fasano, G., Lucidi, S.: A nonmonotone truncated Newton\u2013Krylov method exploiting negative curvature directions, for large scale unconstrained optimization. Optim. Lett. 3, 521\u2013535 (2009)","journal-title":"Optim. Lett."},{"key":"600_CR21","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"600_CR22","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718140","volume-title":"The Lanczos and Conjugate Gradient Algorithms\u2014From Theory to Finite Precision Computations","author":"G Meurant","year":"2006","unstructured":"Meurant, G.: The Lanczos and Conjugate Gradient Algorithms\u2014From Theory to Finite Precision Computations. SIAM, Philadelphia (2006)"},{"key":"600_CR23","volume-title":"Introduction to Optimization, Translation Series in Mathematics and Engineering","author":"TB Polyak","year":"1987","unstructured":"Polyak, T.B.: Introduction to Optimization, Translation Series in Mathematics and Engineering. Optimization Software Inc., Publications Division, New York (1987)"},{"key":"600_CR24","volume-title":"Generalized Inverses of Linear Transformations","author":"SL Campbell","year":"1979","unstructured":"Campbell, S.L., Meyer, C.D.: Generalized Inverses of Linear Transformations. Dover Publications, New York (1979)"},{"key":"600_CR25","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10957-005-2088-0","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar-conjugate gradient algorithm for large scale unconstrained optimization. Part 1: Theory. J. Optim. Theory Appl. 125, 543\u2013558 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"600_CR26","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":"600_CR27","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 non-convex large scale optimization. Comput. Optim. Appl. 56, 253\u2013290 (2013)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0600-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0600-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0600-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:38Z","timestamp":1559469518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0600-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["600"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0600-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,15]]}}}