{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:43:25Z","timestamp":1757450605786,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["DE-AC52-07NA27344","LDRD Program: 16-ERD-025"],"award-info":[{"award-number":["DE-AC52-07NA27344","LDRD Program: 16-ERD-025"]}],"id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["17-SI-005"],"award-info":[{"award-number":["17-SI-005"]}],"id":[{"id":"10.13039\/100006227","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,12]]},"DOI":"10.1007\/s10589-019-00127-4","type":"journal-article","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T16:07:18Z","timestamp":1567786038000},"page":"669-701","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3748-2440","authenticated-orcid":false,"given":"Johannes J.","family":"Brust","sequence":"first","affiliation":[]},{"given":"Roummel F.","family":"Marcia","sequence":"additional","affiliation":[]},{"given":"Cosmin G.","family":"Petra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,5]]},"reference":[{"key":"127_CR1","volume-title":"Convex Optimization","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2007)"},{"key":"127_CR2","unstructured":"Brust, J.J., Burdakov, O., Erway, J.B., Marcia, R.F., Yuan, Y.X.: Shape-changing L-SR1 trust-region methods. Technical Report 2016-2, Department of Mathematics, Wake Forest University (2016)"},{"issue":"1","key":"127_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10589-019-00112-x","volume":"74","author":"JJ Brust","year":"2019","unstructured":"Brust, J.J., Burdakov, O.P., Erway, J.B., Marcia, R.F.: Dense initializations for limited-memory quasi-Newton methods. Comput. Optim. Appl. 74(1), 121\u2013142 (2019). \nhttps:\/\/doi.org\/10.1007\/s10589-019-00112-x","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"127_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10589-016-9868-3","volume":"66","author":"JJ Brust","year":"2017","unstructured":"Brust, J.J., Erway, J.B., Marcia, R.F.: On solving L-SR1 trust-region subproblems. Comput. Optim. Appl. 66(2), 245\u2013266 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"127_CR5","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":"127_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1021561204463","volume":"117","author":"O Burdakov","year":"2002","unstructured":"Burdakov, O., Martinez, J., Pilotta, E.: A limited-memory multipoint symmetric secant method for bound constrained optimization. Ann. Oper. Res. 117, 51\u201370 (2002)","journal-title":"Ann. Oper. Res."},{"key":"127_CR7","unstructured":"Burke, J.V., Wiegmann, A., Xu, L.: Limited memory BFGS updating in a trust-region framework. Technical Report, University of Washington (1996)"},{"key":"127_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R.H., Gilbert, J.C., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program. Ser. A 89, 149\u2013185 (2000)","journal-title":"Math. Program. Ser. A"},{"key":"127_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"RH Byrd","year":"1999","unstructured":"Byrd, R.H., Hribar, M., Nocedal, J.: An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9, 877\u2013900 (1999)","journal-title":"SIAM J. Optim."},{"key":"127_CR10","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."},{"key":"127_CR11","doi-asserted-by":"crossref","unstructured":"Celis, M., Dennis\u00a0Jr., J., Tapia, R.: A trust region strategy for equality constrained optimization. Technical Report 84-1, Mathematical Sciences Department, Rice University (1984)","DOI":"10.21236\/ADA454933"},{"key":"127_CR12","volume-title":"Optimization Toolbox for Use with MATLAB","author":"T Coleman","year":"1999","unstructured":"Coleman, T., Branch, M.A., Grace, A.: Optimization Toolbox for Use with MATLAB. MathWorks, Natick (1999)"},{"key":"127_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1011271406353","volume":"20","author":"T Coleman","year":"2001","unstructured":"Coleman, T., Verma, A.: A preconditioned conjugate gradient approach to linear equality constrained minimization. Comput. Optim. Appl. 20, 61\u201372 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"127_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"issue":"5","key":"127_CR15","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":"127_CR16","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":"4","key":"127_CR17","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2616588","volume":"40","author":"JB Erway","year":"2014","unstructured":"Erway, J.B., Marcia, R.F.: Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization. ACM Trans. Math. Softw. 40(4), 28:1\u201328:12 (2014). \nhttps:\/\/doi.org\/10.1145\/2616588","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"127_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/1031049","volume":"31","author":"WW Hager","year":"1989","unstructured":"Hager, W.W.: Updating the inverse of a matrix. SIAM Rev. 31(2), 221\u2013239 (1989)","journal-title":"SIAM Rev."},{"issue":"3","key":"127_CR19","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1137\/S1052623493262993","volume":"8","author":"M Lalee","year":"1998","unstructured":"Lalee, M., Nocedal, J., Plantenga, T.: On the implementation of an algorithm for large-scale equality constrained optimization. SIAM J. Optim. 8(3), 682\u2013706 (1998)","journal-title":"SIAM J. Optim."},{"key":"127_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"127_CR21","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"127_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"M Powell","year":"1991","unstructured":"Powell, M., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189\u2013211 (1991)","journal-title":"Math. Program."},{"key":"127_CR23","unstructured":"Saunders, M.A.: PDCO: Primal-dual interior method for convex objectives (2002\u20132015). \nhttp:\/\/www.stanford.edu\/group\/SOL\/software\/pdco.html\n\n. Accessed 21 June 2018"},{"key":"127_CR24","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"127_CR25","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0722035","volume":"22","author":"A Vardi","year":"1985","unstructured":"Vardi, A.: A trust region algorithm for equality constrained minimization: convergence properties and implementation. SIAM J. Numer. Anal. 22(3), 575\u2013591 (1985)","journal-title":"SIAM J. Numer. Anal."},{"key":"127_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"127_CR27","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"R Waltz","year":"1999","unstructured":"Waltz, R., Morales, J., Nocedal, J., Orban, D.: An interior algorithm for nonlinear optimization that combines line search and trust region steps. SIAM. J. Optim. 9, 877\u2013900 (1999)","journal-title":"SIAM. J. Optim."},{"key":"127_CR28","unstructured":"Yuan, Y.X.: Trust region algorithms for constrained optimization. Technical report, State Key Laboratory of Scientific and Engineering Computing, Beijing"},{"key":"127_CR29","unstructured":"Zhijiang, S.: RSQP toolbox for MATLAB (2006). \nhttps:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/13046-rsqp-toolbox-for-matlab\n\n. Accessed 21 June 2018"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00127-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00127-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00127-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:40:59Z","timestamp":1599176459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00127-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,5]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["127"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00127-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,9,5]]},"assertion":[{"value":"31 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}