{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:00:58Z","timestamp":1761663658311,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["621-2014-4772"],"award-info":[{"award-number":["621-2014-4772"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10589-017-9940-7","type":"journal-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T08:46:16Z","timestamp":1504169176000},"page":"225-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On exact linesearch quasi-Newton methods for minimizing a quadratic function"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6252-7815","authenticated-orcid":false,"given":"Anders","family":"Forsgren","sequence":"first","affiliation":[]},{"given":"Tove","family":"Odland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,31]]},"reference":[{"issue":"1","key":"9940_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0801001","volume":"1","author":"WC Davidon","year":"1991","unstructured":"Davidon, W.C.: Variable metric method for minimization. SIAM J. Optim. 1(1), 1\u201317 (1991)","journal-title":"SIAM J. Optim."},{"key":"9940_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)"},{"key":"9940_CR3","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. A Wiley-Interscience Publication. Wiley, Chichester (1987)","edition":"2"},{"key":"9940_CR4","doi-asserted-by":"crossref","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6, 163\u2013168 (1963\/1964)","DOI":"10.1093\/comjnl\/6.2.163"},{"key":"9940_CR5","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.M.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"2","key":"9940_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10589-014-9677-5","volume":"60","author":"A Forsgren","year":"2015","unstructured":"Forsgren, A., Odland, T.: On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems. Comput. Optim. Appl. 60(2), 377\u2013392 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"9940_CR7","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London (1981)"},{"key":"9940_CR8","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 3rd edn., pp. xxx+698. Johns Hopkins University Press, Baltimore, MD (1996)"},{"issue":"4","key":"9940_CR9","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"WW Hager","year":"2013","unstructured":"Hager, W.W., Zhang, H.: The limited memory conjugate gradient method. SIAM J. Optim. 23(4), 2150\u20132168 (2013)","journal-title":"SIAM J. Optim."},{"issue":"409\u2013436","key":"9940_CR10","first-page":"1952","volume":"49","author":"MR Hestenes","year":"1953","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49(409\u2013436), 1952 (1953)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"9940_CR11","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF00927440","volume":"5","author":"HY Huang","year":"1970","unstructured":"Huang, H.Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Optim. Theory Appl. 5, 405\u2013423 (1970)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"9940_CR12","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1137\/S1052623496306450","volume":"8","author":"TG Kolda","year":"1998","unstructured":"Kolda, T.G., O\u2019Leary, D.P., Nazareth, L.: BFGS with update skipping and varying memory. SIAM J. Optim. 8(4), 1060\u20131083 (1998). electronic","journal-title":"SIAM J. Optim."},{"key":"9940_CR13","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger, D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley Pub Co, Boston (1984)","edition":"2"},{"issue":"5","key":"9940_CR14","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(5), 794\u2013800 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"9940_CR15","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. Society for Industrial and Applied Mathematics, Philadelphia (2003)","edition":"2"},{"key":"9940_CR16","unstructured":"Shewchuk, J.R.: An introduction to the conjugate gradient method without the agonizing pain. Technical report, Carnegie-Mellon University, Pittsburgh, PA, USA (1994)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9940-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9940-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9940-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T20:27:33Z","timestamp":1570048053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9940-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9940"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9940-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2017,8,31]]}}}