{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:24:17Z","timestamp":1762608257138,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:00:00Z","timestamp":1619568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:00:00Z","timestamp":1619568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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"}]},{"DOI":"10.13039\/501100004270","name":"Royal Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004270","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The main focus in this paper is exact linesearch methods for minimizing a quadratic function whose Hessian is positive definite. We give a class of limited-memory quasi-Newton Hessian approximations which generate search directions parallel to those of the BFGS method, or equivalently, to those of the method of preconditioned conjugate gradients. In the setting of reduced Hessians, the class provides a dynamical framework for the construction of limited-memory quasi-Newton methods. These methods attain finite termination on quadratic optimization problems in exact arithmetic. We show performance of the methods within this framework in finite precision arithmetic by numerical simulations on sequences of related systems of linear equations, which originate from the CUTEst test collection. In addition, we give a compact representation of the Hessian approximations in the full Broyden class for the general unconstrained optimization problem. This representation consists of explicit matrices and gradients only as vector components.<\/jats:p>","DOI":"10.1007\/s10589-021-00277-4","type":"journal-article","created":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T11:03:21Z","timestamp":1619607801000},"page":"789-816","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function"],"prefix":"10.1007","volume":"79","author":[{"given":"David","family":"Ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6252-7815","authenticated-orcid":false,"given":"Anders","family":"Forsgren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,28]]},"reference":[{"issue":"2, Ser. A","key":"277_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(2, Ser. A), 129\u2013156 (1994). https:\/\/doi.org\/10.1007\/BF01582063","journal-title":"Math. Program."},{"issue":"1","key":"277_CR2","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/0801001","journal-title":"SIAM J. Optim."},{"key":"277_CR3","doi-asserted-by":"crossref","unstructured":"DeGuchy, O., Erway, J.B., Marcia, R.F.: Compact representation of the full Broyden class of quasi-Newton updates. arXiv:1705.08306 (2017)","DOI":"10.1002\/nla.2186"},{"key":"277_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01584554","volume":"2","author":"LCW Dixon","year":"1972","unstructured":"Dixon, L.C.W.: Quasi-Newton algorithms generate identical points. Math. Program. 2, 383\u2013387 (1972). https:\/\/doi.org\/10.1007\/BF01584554","journal-title":"Math. Program."},{"issue":"2","key":"277_CR5","doi-asserted-by":"publisher","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(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"3","key":"277_CR6","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/140997737","volume":"36","author":"JB Erway","year":"2015","unstructured":"Erway, J.B., Marcia, R.F.: On efficiently computing the eigenvalues of limited-memory quasi-Newton matrices. SIAM J. Matrix Anal. Appl. 36(3), 1338\u20131359 (2015). https:\/\/doi.org\/10.1137\/140997737","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"277_CR7","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.laa.2016.11.003","volume":"515","author":"JB Erway","year":"2017","unstructured":"Erway, J.B., Marcia, R.F.: On solving large-scale limited-memory quasi-Newton equations. Linear Algebra Appl. 515, 196\u2013225 (2017). https:\/\/doi.org\/10.1016\/j.laa.2016.11.003","journal-title":"Linear Algebra Appl."},{"key":"277_CR8","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, Chichester (1987)","edition":"2"},{"key":"277_CR9","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: An overview of unconstrained optimization. In: Algorithms for Continuous Optimization (Il Ciocco, 1993), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 434, pp. 109\u2013143. Kluwer Acad. Publ., Dordrecht (1994)","DOI":"10.1007\/978-94-009-0369-2_5"},{"key":"277_CR10","doi-asserted-by":"publisher","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6, 163\u2013168 (1963\/1964). https:\/\/doi.org\/10.1093\/comjnl\/6.2.163","DOI":"10.1093\/comjnl\/6.2.163"},{"issue":"1","key":"277_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10589-017-9940-7","volume":"69","author":"A Forsgren","year":"2018","unstructured":"Forsgren, A., Odland, T.: On exact linesearch quasi-Newton methods for minimizing a quadratic function. Comput. Optim. Appl. 69(1), 225\u2013241 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9940-7","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"277_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1137\/S1052623400307950","volume":"12","author":"PE Gill","year":"2001","unstructured":"Gill, P.E., Leonard, M.W.: Reduced-Hessian quasi-Newton methods for unconstrained optimization. SIAM J. Optim. 12(1), 209\u2013237 (2001). https:\/\/doi.org\/10.1137\/S1052623400307950","journal-title":"SIAM J. Optim."},{"issue":"2","key":"277_CR13","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/S1052623497319973","volume":"14","author":"PE Gill","year":"2003","unstructured":"Gill, P.E., Leonard, M.W.: Limited-memory reduced-Hessian methods for large-scale unconstrained optimization. SIAM J. Optim. 14(2), 380\u2013401 (2003). https:\/\/doi.org\/10.1137\/S1052623497319973","journal-title":"SIAM J. Optim."},{"key":"277_CR14","volume-title":"Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"issue":"3","key":"277_CR15","doi-asserted-by":"publisher","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 for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015). https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput. Optim. Appl."},{"key":"277_CR16","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1953","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bureau Standards 49, 409\u2013436 (1953)","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"277_CR17","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/BF00927440","journal-title":"J. Optim. Theory Appl."},{"issue":"151","key":"277_CR18","doi-asserted-by":"publisher","first-page":"773","DOI":"10.2307\/2006193","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980). https:\/\/doi.org\/10.2307\/2006193","journal-title":"Math. Comput."},{"key":"277_CR19","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"277_CR20","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A.S.: JuliaSmoothOptimizers: Infrastructure and solvers for continuous optimization in Julia (2019). https:\/\/doi.org\/10.5281\/zenodo.2655082. https:\/\/juliasmoothoptimizers.github.io","DOI":"10.5281\/zenodo.2655082"},{"key":"277_CR21","unstructured":"Pytlak, R.A.: Conjugate gradient algorithms in nonconvex optimization. Nonconvex Optimization and its Applications, vol.\u00a089. Springer-Verlag, Berlin (2009)"},{"key":"277_CR22","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Iterative methods for sparse linear systems, second edn. Society for Industrial and Applied Mathematics, Philadelphia, PA (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","DOI":"10.1137\/1.9780898718003"},{"issue":"3","key":"277_CR23","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3(3), 244\u2013256 (1978). https:\/\/doi.org\/10.1287\/moor.3.3.244","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00277-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00277-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00277-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T19:21:56Z","timestamp":1623957716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00277-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,28]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["277"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00277-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,4,28]]},"assertion":[{"value":"28 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}