{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T09:09:53Z","timestamp":1769418593312,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:00:00Z","timestamp":1559088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:00:00Z","timestamp":1559088000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334042"],"award-info":[{"award-number":["CMMI-1334042"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1741264"],"award-info":[{"award-number":["IIS-1741264"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1333326"],"award-info":[{"award-number":["CMMI-1333326"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1741490"],"award-info":[{"award-number":["IIS-1741490"]}],"id":[{"id":"10.13039\/100000001","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":[[2019,9]]},"DOI":"10.1007\/s10589-019-00112-x","type":"journal-article","created":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:22:32Z","timestamp":1559139752000},"page":"121-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A dense initialization for limited-memory quasi-Newton methods"],"prefix":"10.1007","volume":"74","author":[{"given":"Johannes","family":"Brust","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Burdakov","sequence":"additional","affiliation":[]},{"given":"Jennifer B.","family":"Erway","sequence":"additional","affiliation":[]},{"given":"Roummel F.","family":"Marcia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,29]]},"reference":[{"key":"112_CR1","unstructured":"Becker, S.: LBFGSB (L-BFGS-B) mex wrapper (2012\u20132015). \n                    https:\/\/www.mathworks.com\/matlab central\/fileexchange\/35104-lbfgsb-l-bfgs-b-mex-wrapper\n                    \n                  . Accessed Jan 2017"},{"key":"112_CR2","unstructured":"Brust, J., Burdakov, O., Erway, J.B., Marcia, R.F., Yuan, Y.X.: Shape-changing L-SR1 trust-region methods. Technical Report 2016-2, Wake Forest University (2016)"},{"key":"112_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12532-016-0109-7","volume":"9","author":"O Burdakov","year":"2016","unstructured":"Burdakov, O., Gong, L., Yuan, Y.X., Zikrin, S.: On efficiently combining limited memory and trust-region techniques. Math. Program. Comput. 9, 101\u2013134 (2016)","journal-title":"Math. Program. Comput."},{"key":"112_CR4","unstructured":"Burke, J.V., Wiegmann, A., Xu, L.: Limited memory BFGS updating in a trust-region framework. Technical Report, University of Washington (1996)"},{"key":"112_CR5","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, 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"5","key":"112_CR6","doi-asserted-by":"publisher","first-page":"e2186","DOI":"10.1002\/nla.2186","volume":"25","author":"O DeGuchy","year":"2018","unstructured":"DeGuchy, O., Erway, J.B., Marcia, R.F.: Compact representation of the full Broyden class of quasi-Newton updates. Numer. Linear Algebra Appl. 25(5), e2186 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"112_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"112_CR8","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)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"112_CR9","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)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"112_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"112_CR11","unstructured":"Lu, X.: A study of the limited memory SR1 method in practice. Ph.D. thesis, University of Colorado (1992)"},{"key":"112_CR12","first-page":"224","volume":"49","author":"L Luk\u0161an","year":"2013","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Recursive form of general limited memory variable metric methods. Kybernetika 49, 224\u2013235 (2013)","journal-title":"Kybernetika"},{"key":"112_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"issue":"1","key":"112_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01588962","volume":"14","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F., Phua, K.H.: Matrix conditioning and nonlinear optimization. Math. Program. 14(1), 149\u2013160 (1978)","journal-title":"Math. Program."},{"key":"112_CR15","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23, 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00112-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00112-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00112-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T23:36:29Z","timestamp":1590622589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00112-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,29]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00112-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,29]]},"assertion":[{"value":"24 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}