{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:27:46Z","timestamp":1775896066228,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["F4FGA09135G001"],"award-info":[{"award-number":["F4FGA09135G001"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11590-021-01794-1","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T07:04:47Z","timestamp":1631862287000},"page":"983-997","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A matrix-free trust-region newton algorithm for convex-constrained optimization"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7079-3195","authenticated-orcid":false,"given":"D. P.","family":"Kouri","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"issue":"3","key":"1794_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/02331930500100270","volume":"54","author":"M Andretta","year":"2005","unstructured":"Andretta, M., Birgin, E.G., Mart\u00ednez, J.M.: Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization. Optimization 54(3), 305\u2013325 (2005)","journal-title":"Optimization"},{"key":"1794_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-8636-1","volume-title":"Frontiers in PDE-constrained optimization","author":"H Antil","year":"2018","unstructured":"Antil, H., Kouri, D.P., Lacasse, M.D., Ridzal, D.: Frontiers in PDE-constrained optimization, vol. 163. Springer, Cham (2018)"},{"issue":"2","key":"1794_CR3","first-page":"115","volume":"20","author":"CG Baker","year":"2012","unstructured":"Baker, C.G., Heroux, M.A.: Tpetra, and the use of generic programming in scientific computing. Sci. Program. 20(2), 115\u2013128 (2012)","journal-title":"Sci. Program."},{"key":"1794_CR4","volume-title":"Topology optimization: theory, methods, and applications","author":"MP Bendsoe","year":"2013","unstructured":"Bendsoe, M.P., Sigmund, O.: Topology optimization: theory, methods, and applications. Springer, Cham (2013)"},{"issue":"4","key":"1794_CR5","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Opt. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Opt."},{"issue":"4","key":"1794_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23(4), 539\u2013559 (2003)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"1794_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v060.i03","volume":"60","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw 60(3), 1\u201321 (2014)","journal-title":"J. Stat. Softw"},{"issue":"2","key":"1794_CR8","first-page":"151","volume":"20","author":"P Bochev","year":"2012","unstructured":"Bochev, P., Edwards, H.C., Kirby, R.C., Peterson, K., Ridzal, D.: Solving PDEs with intrepid. Sci. Program. 20(2), 151\u2013180 (2012)","journal-title":"Sci. Program."},{"issue":"1","key":"1794_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/fld.426","volume":"41","author":"T Borrvall","year":"2003","unstructured":"Borrvall, T., Petersson, J.: Topology optimization of fluids in stokes flow. Int. J. Numer. Methods Fluids 41(1), 77\u2013107 (2003)","journal-title":"Int. J. Numer. Methods Fluids"},{"key":"1794_CR10","unstructured":"Brent, R.P.: Algorithms for minimization without derivatives. Courier Corporation (2013)"},{"issue":"1\u20133","key":"1794_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01580867","volume":"47","author":"JV Burke","year":"1990","unstructured":"Burke, J.V., Mor\u00e9, J.J., Toraldo, G.: Convergence properties of trust region methods for linear and convex constraints. Math. Program. 47(1\u20133), 305\u2013336 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"1794_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"1","key":"1794_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/0803009","volume":"3","author":"AR Conn","year":"1993","unstructured":"Conn, A.R., Gould, N.I.M., Sartenaer, A., Toint, P.L.: Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints. SIAM J. Opt. 3(1), 164\u2013221 (1993). https:\/\/doi.org\/10.1137\/0803009","journal-title":"SIAM J. Opt."},{"issue":"4","key":"1794_CR14","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1137\/S1052623492236481","volume":"6","author":"AR Conn","year":"1996","unstructured":"Conn, A.R., Gould, N.I.M., Sartenaer, A., Toint, P.L.: Convergence properties of minimization algorithms for convex constraints using a structured trust region. SIAM J. Opt. 6(4), 1059\u20131086 (1996). https:\/\/doi.org\/10.1137\/S1052623492236481","journal-title":"SIAM J. Opt."},{"issue":"2","key":"1794_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0728030","volume":"28","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28(2), 545\u2013572 (1991). https:\/\/doi.org\/10.1137\/0728030","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1794_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"YH Dai","year":"2006","unstructured":"Dai, Y.H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403\u2013421 (2006)","journal-title":"Math. Program."},{"key":"1794_CR17","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.cma.2012.11.015","volume":"255","author":"Y Deng","year":"2013","unstructured":"Deng, Y., Liu, Z., Wu, J., Wu, Y.: Topology optimization of steady Navier-Stokes flow with body force. Comput. Methods Appl. Mech. Eng. 255, 306\u2013321 (2013)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"1794_CR18","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"1794_CR19","doi-asserted-by":"publisher","first-page":"401","DOI":"10.2140\/pjm.1982.103.401","volume":"103","author":"J Hartung","year":"1982","unstructured":"Hartung, J.: An extension of Sion\u2019s minimax theorem with an application to a method for constrained games. Pacific J. Math. 103(2), 401\u2013408 (1982)","journal-title":"Pacific J. Math."},{"key":"1794_CR20","unstructured":"Heinkenschloss, M.: Numerical solution of implicitly constrained optimization problems. Rice University, Tech. rep. (2008)"},{"key":"1794_CR21","unstructured":"Kouri, D.P., von Winckel, G., Ridzal, D.: ROL: Rapid Optimization Library. https:\/\/trilinos.org\/packages\/rol (2017)"},{"issue":"6","key":"1794_CR22","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1002\/nme.3072","volume":"86","author":"BS Lazarov","year":"2011","unstructured":"Lazarov, B.S., Sigmund, O.: Filters in topology optimization based on Helmholtz-type differential equations. Int. J. Numer. Methods Eng. 86(6), 765\u2013781 (2011)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"4","key":"1794_CR23","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"CJ Lin","year":"1999","unstructured":"Lin, C.J., Mor\u00e9, J.J.: Newton\u2019s method for large bound-constrained optimization problems. SIAM J. Opt. 9(4), 1100\u20131127 (1999)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"1794_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10589-012-9477-8","volume":"54","author":"MC Maciel","year":"2013","unstructured":"Maciel, M.C., Mendon\u00e7a, M.G., Verdiell, A.B.: Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems. Comput. Opt. Appl. 54(1), 27\u201343 (2013)","journal-title":"Comput. Opt. Appl."},{"key":"1794_CR25","unstructured":"Meyer, M., Vlachos, P.: StatLib\u2014datasets archive. http:\/\/lib.stat.cmu.edu\/datasets\/. Accessed: 2021-05-10"},{"issue":"3","key":"1794_CR26","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-7152(96)00140-X","volume":"33","author":"RK Pace","year":"1997","unstructured":"Pace, R.K., Barry, R.: Sparse spatial autoregressions. Stat. Probab. Lett. 33(3), 291\u2013297 (1997)","journal-title":"Stat. Probab. Lett."},{"key":"1794_CR27","unstructured":"Sala, M., Stanley, K., Heroux, M.: Amesos: A set of general interfaces to sparse direct solver libraries. In: Proceedings of PARA\u201906 Conference, Umea, Sweden (2006)"},{"issue":"3","key":"1794_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.future.2003.07.011","volume":"20","author":"O Schenk","year":"2004","unstructured":"Schenk, O., G\u00e4rtner, K.: Solving unsymmetric sparse systems of linear equations with PARDISO. Future Gener. Comput. Syst. 20(3), 475\u2013487 (2004)","journal-title":"Future Gener. Comput. Syst."},{"key":"1794_CR29","unstructured":"Schmidt, M., Berg, E., Friedlander, M., Murphy, K.: Optimizing costly functions with simple constraints: A limited-memory projected quasi-Newton algorithm. In: D.\u00a0van Dyk, M.\u00a0Welling (eds.) Proceedings of the Twelth International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol.\u00a05, pp. 456\u2013463. PMLR, Hilton Clearwater Beach Resort, Clearwater Beach, Florida USA (2009)"},{"issue":"2","key":"1794_CR30","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1093\/imanum\/8.2.231","volume":"8","author":"PL Toint","year":"1988","unstructured":"Toint, P.L.: Global convergence of a clas of trust-region methods for nonconvex minimization in Hilbert space. IMA J. Numer. Anal. 8(2), 231\u2013252 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.2.231","journal-title":"IMA J. Numer. Anal."},{"key":"1794_CR31","doi-asserted-by":"crossref","unstructured":"Tr\u00f6ltzsch, F.: Optimal control of partial differential equations: theory, methods, and applications. Graduate studies in mathematics. American Mathematical Society (2010)","DOI":"10.1090\/gsm\/112"},{"key":"1794_CR32","volume-title":"The nature of statistical learning theory","author":"VN Vapnik","year":"2013","unstructured":"Vapnik, V.N.: The nature of statistical learning theory. Springer, New York (2013)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01794-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01794-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01794-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T06:22:05Z","timestamp":1647843725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01794-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,17]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1794"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01794-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,17]]},"assertion":[{"value":"7 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}