{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:28:47Z","timestamp":1759332527570,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227432"},{"type":"electronic","value":"9783030227449"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22744-9_39","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:29:16Z","timestamp":1559928556000},"page":"495-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Accelerating Limited-Memory Quasi-Newton Convergence for Large-Scale Optimization"],"prefix":"10.1007","author":[{"given":"Alp","family":"Dener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Munson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"39_CR1","unstructured":"Balay, S., et al.: PETSc users manual. Technical report ANL-95\/11 - Revision 3.10, Argonne National Laboratory (2018). http:\/\/www.mcs.anl.gov\/petsc"},{"issue":"2","key":"39_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/S106482750241565X","volume":"27","author":"G Biros","year":"2005","unstructured":"Biros, G., Ghattas, O.: Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization. Part i: The Krylov-Schur solver. SIAM J. Sci. Comput. 27(2), 687\u2013713 (2005)","journal-title":"SIAM J. Sci. Comput."},{"issue":"92","key":"39_CR4","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1090\/S0025-5718-1965-0198670-6","volume":"19","author":"CG Broyden","year":"1965","unstructured":"Broyden, C.G.: A class of methods for solving nonlinear simultaneous equations. Math. Comput. 19(92), 577\u2013593 (1965)","journal-title":"Math. Comput."},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 1. General considerations. IMA J. Appl. Math. 6(1), 76\u201390 (1970)","journal-title":"IMA J. Appl. Math."},{"key":"39_CR6","unstructured":"Burke, J.V., Wiegmann, A., Xu, L.: Limited memory BFGS updating in a trust-region framework. Technical report, Department of Mathematics, University of Washington (2008)"},{"issue":"5","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20133","key":"39_CR8","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(1\u20133), 129\u2013156 (1994)","journal-title":"Math. Program."},{"key":"39_CR9","unstructured":"D\u2019Alves, C.: A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value. Ph.D. thesis (2017)"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Davidon, W.C.: Variable metric method for minimization, argonne natl. Technical report No. ANL-5990, Argonne National Laboratory (1959)","DOI":"10.2172\/4252678"},{"issue":"1","key":"39_CR11","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)","journal-title":"SIAM J. Optim."},{"key":"39_CR12","unstructured":"Dener, A., et al.: Tao users manual. Technical report ANL\/MCS-TM-322 - Revision 3.10, Argonne National Laboratory (2018). http:\/\/www.mcs.anl.gov\/petsc"},{"issue":"6","key":"39_CR13","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1007\/s00158-017-1734-0","volume":"56","author":"A Dener","year":"2017","unstructured":"Dener, A., Hicken, J.E.: Matrix-free algorithm for the optimization of multidisciplinary systems. Struct. Multidiscip. Optim. 56(6), 1429\u20131446 (2017)","journal-title":"Struct. Multidiscip. Optim."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Dener, A., Hicken, J.E., Kenway, G.K., Martins, J.: Enabling modular aerostructural optimization: individual discipline feasible without the Jacobians. In: 2018 Multidisciplinary Analysis and Optimization Conference, p. 3570 (2018)","DOI":"10.2514\/6.2018-3570"},{"issue":"1","key":"39_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JE Dennis Jr","year":"1977","unstructured":"Dennis Jr., J.E., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19(1), 46\u201389 (1977)","journal-title":"SIAM Rev."},{"issue":"2","key":"39_CR16","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)","journal-title":"Math. Program."},{"key":"39_CR17","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 Algebr. Appl. 515, 196\u2013225 (2017)","journal-title":"Linear Algebr. Appl."},{"issue":"3","key":"39_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13(3), 317\u2013322 (1970)","journal-title":"Comput. J."},{"issue":"2","key":"39_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher, R., Powell, M.J.: A rapidly convergent descent method for minimization. Comput. J. 6(2), 163\u2013168 (1963)","journal-title":"Comput. J."},{"issue":"1\u20133","key":"39_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01589113","volume":"45","author":"JC Gilbert","year":"1989","unstructured":"Gilbert, J.C., Lemar\u00e9chal, C.: Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45(1\u20133), 407\u2013435 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"39_CR21","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)","journal-title":"SIAM J. Optim."},{"issue":"109","key":"39_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comput. 24(109), 23\u201326 (1970)","journal-title":"Math. Comput."},{"issue":"3","key":"39_CR23","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., 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)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"39_CR24","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.1088\/0266-5611\/17\/6\/319","volume":"17","author":"E Haber","year":"2001","unstructured":"Haber, E., Ascher, U.M.: Preconditioned all-at-once methods for large, sparse parameter estimation problems. Inverse Probl. 17(6), 1847 (2001)","journal-title":"Inverse Probl."},{"issue":"2","key":"39_CR25","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":"2","key":"39_CR26","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006)","journal-title":"SIAM J. Optim."},{"key":"39_CR27","doi-asserted-by":"crossref","unstructured":"Hicken, J., Alonso, J.: Comparison of reduced-and full-space algorithms for PDE-constrained optimization. In: 51st AIAA Aerospace Sciences Meeting including the New Horizons Forum and Aerospace Exposition, p. 1043 (2013)","DOI":"10.2514\/6.2013-1043"},{"issue":"2","key":"39_CR28","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10957-007-9203-3","volume":"133","author":"M Hinze","year":"2007","unstructured":"Hinze, M., Pinnau, R.: Second-order approach to optimal semiconductor design. J. Optim. Theory Appl. 133(2), 179\u2013199 (2007)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20133","key":"39_CR29","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1\u20133), 503\u2013528 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"39_CR30","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"JJ Mor\u00e9","year":"1994","unstructured":"Mor\u00e9, J.J., Thuente, D.J.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. (TOMS) 20(3), 286\u2013307 (1994)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"39_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9, J.J., Toraldo, G.: On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. 1(1), 93\u2013113 (1991)","journal-title":"SIAM J. Optim."},{"key":"39_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","edition":"2"},{"issue":"10","key":"39_CR33","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1002\/fld.1584","volume":"56","author":"D Papadimitriou","year":"2008","unstructured":"Papadimitriou, D., Giannakoglou, K.: Direct, adjoint and mixed approaches for the computation of Hessian in airfoil design problems. Int. J. Numer. Methods Fluids 56(10), 1929\u20131943 (2008)","journal-title":"Int. J. Numer. Methods Fluids"},{"issue":"111","key":"39_CR34","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24(111), 647\u2013656 (1970)","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22744-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:52:22Z","timestamp":1686099142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22744-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227432","9783030227449"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22744-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}