{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T10:52:30Z","timestamp":1750071150771,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,12]],"date-time":"2021-01-12T00:00:00Z","timestamp":1610409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,12]],"date-time":"2021-01-12T00:00:00Z","timestamp":1610409600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10589-020-00256-1","type":"journal-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T16:01:32Z","timestamp":1610553692000},"page":"953-982","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Secant Update generalized version of PSB: a new approach"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3459-564X","authenticated-orcid":false,"given":"Nicolas","family":"Boutet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Haelterman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joris","family":"Degroote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,12]]},"reference":[{"issue":"4","key":"256_CR1","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11081-017-9366-1","volume":"18","author":"V Beiranvand","year":"2017","unstructured":"Beiranvand, V., Hare, W., Lucet, Y.: Best practices for comparing optimization algorithms. Optim. Eng. 18(4), 815\u2013848 (2017)","journal-title":"Optim. Eng."},{"key":"256_CR2","unstructured":"Bertolazzi, E.: Quasi-Newton methods for minimization (2011). http:\/\/www.ing.unitn.it\/~bertolaz\/2-teaching\/2011-2012\/AA-2011-2012-OPTIM\/lezioni\/slides-mQN.pdf"},{"key":"256_CR3","unstructured":"Boutet, N., Haelterman, R., Degroote, J.: Secant update version of quasi-Newton PSB with weighted multisecant equations. Computational Optimization and Applications pp. 1\u201326 (2020). https:\/\/biblio.ugent.be\/publication\/8644687\/file\/8644688"},{"key":"256_CR4","unstructured":"Boyd, S., Dattorro, J.: Alternating projections. EE392o, Stanford University (2003). https:\/\/pdfs.semanticscholar.org\/1ed0\/e86a12d31f1897b96b081489101a79da818a.pdf"},{"issue":"2","key":"256_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s101070050111","volume":"87","author":"C Broyden","year":"2000","unstructured":"Broyden, C.: On the discovery of the \u201cgood Broyden\u201d method. Math. Program. 87(2), 209\u2013213 (2000)","journal-title":"Math. Program."},{"issue":"92","key":"256_CR6","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":"99","key":"256_CR7","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1090\/S0025-5718-1967-0224273-2","volume":"21","author":"CG Broyden","year":"1967","unstructured":"Broyden, C.G.: Quasi-Newton methods and their application to function minimisation. Math. Comput. 21(99), 368\u2013381 (1967)","journal-title":"Math. Comput."},{"issue":"3","key":"256_CR8","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1090\/S0002-9939-1959-0105008-8","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A.A.: Proximity maps for convex sets. Proc. Am. Math. Soc. 10(3), 448\u2013450 (1959)","journal-title":"Proc. Am. Math. Soc."},{"key":"256_CR9","unstructured":"Courrieu, P.: Fast computation of Moore-Penrose inverse matrices. arXiv preprint arXiv:0804.4809 (2008)"},{"issue":"11\u201312","key":"256_CR10","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.compstruc.2008.11.013","volume":"87","author":"J Degroote","year":"2009","unstructured":"Degroote, J., Bathe, K.J., Vierendeels, J.: Performance of a new partitioned procedure versus a monolithic procedure in fluid-structure interaction. Comput. Struct. 87(11\u201312), 793\u2013801 (2009)","journal-title":"Comput. Struct."},{"issue":"1","key":"256_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00158-012-0808-2","volume":"47","author":"J Degroote","year":"2013","unstructured":"Degroote, J., Hojjat, M., Stavropoulou, E., W\u00fcchner, R., Bletzinger, K.U.: Partitioned solution of an unsteady adjoint for strongly coupled fluid-structure interactions and application to parameter identification of a one-dimensional problem. Struct. Multidiscip. Optim. 47(1), 77\u201394 (2013)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"6","key":"256_CR12","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1137\/0718067","volume":"18","author":"J Dennis","year":"1981","unstructured":"Dennis, J., Walker, H.F.: Convergence theorems for least-change secant update methods. SIAM J. Numer. Anal. 18(6), 949\u2013987 (1981)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"256_CR13","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":"256_CR14","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":"256_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0024-3795(92)90252-6","volume":"171","author":"AM DuPr\u00e9","year":"1992","unstructured":"DuPr\u00e9, A.M., Kass, S.: Distance and parallelism between flats in Rn. Linear Algebra Appl. 171, 99\u2013107 (1992)","journal-title":"Linear Algebra Appl."},{"issue":"11","key":"256_CR16","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1175\/1520-0477(1997)078<2577:WIAAM>2.0.CO;2","volume":"78","author":"RM Errico","year":"1997","unstructured":"Errico, R.M.: What is an adjoint model? Bull. Am. Meteorol. Soc. 78(11), 2577\u20132591 (1997)","journal-title":"Bull. Am. Meteorol. Soc."},{"issue":"3","key":"256_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/nla.617","volume":"16","author":"Hr Fang","year":"2009","unstructured":"Fang, Hr, Saad, Y.: Two classes of multisecant methods for nonlinear acceleration. Numer. Linear Algebra Appl. 16(3), 197\u2013221 (2009)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"256_CR18","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":"4","key":"256_CR19","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1080\/10556788.2014.971025","volume":"30","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Malmedy, V., Toint, P.L.: Quasi-Newton updates with weighted secant equations. Optim. Methods Softw. 30(4), 748\u2013755 (2015)","journal-title":"Optim. Methods Softw."},{"key":"256_CR20","unstructured":"Gratton, S., Toint, P.: Multi-secant equations, approximate invariant subspaces and multigrid optimization. Ph.D. thesis, tech. rep., Dept of Mathematics, FUNDP, Namur (B) (2007). http:\/\/perso.fundp.ac.be\/~phtoint\/pubs\/TR07-11.pdf"},{"key":"256_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0024-3795(95)00648-6","volume":"237","author":"J Gross","year":"1996","unstructured":"Gross, J., Trenkler, G.: On the least squares distance between affine subspaces. Linear Algebra Appl 237, 269\u2013276 (1996)","journal-title":"Linear Algebra Appl"},{"key":"256_CR22","unstructured":"Haelterman, R.: Analytical study of the least squares quasi-Newton method for interaction problems. Ph.D. thesis, Ghent University (2009). https:\/\/biblio.ugent.be\/publication\/720660"},{"issue":"3","key":"256_CR23","first-page":"352","volume":"47","author":"R Haelterman","year":"2017","unstructured":"Haelterman, R., Bogaers, A., Degroote, J., Boutet, N.: Quasi-Newton methods for the acceleration of multi-physics codes. Int. J. Appl. Math. 47(3), 352\u2013360 (2017)","journal-title":"Int. J. Appl. Math."},{"key":"256_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.compstruc.2016.04.001","volume":"171","author":"R Haelterman","year":"2016","unstructured":"Haelterman, R., Bogaers, A.E., Scheufele, K., Uekermann, B., Mehl, M.: Improving the performance of the partitioned QN-ILS procedure for fluid-structure interaction problems: Filtering. Comput. Struct. 171, 9\u201317 (2016)","journal-title":"Comput. Struct."},{"issue":"3","key":"256_CR25","doi-asserted-by":"publisher","first-page":"2347","DOI":"10.1137\/070710469","volume":"47","author":"R Haelterman","year":"2009","unstructured":"Haelterman, R., Degroote, J., Van Heule, D., Vierendeels, J.: The quasi-Newton least squares method: A new and fast secant method analyzed for linear systems. SIAM J Numer. Anal. 47(3), 2347\u20132368 (2009)","journal-title":"SIAM J Numer. Anal."},{"issue":"1","key":"256_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0803001","volume":"3","author":"HF Khalfan","year":"1993","unstructured":"Khalfan, H.F., Byrd, R.H., Schnabel, R.B.: A theoretical and experimental study of the symmetric rank-one update. SIAM J. Optim. 3(1), 1\u201324 (1993)","journal-title":"SIAM J. Optim."},{"key":"256_CR27","unstructured":"Kim, D., Sra, S., Dhillon, I.S.: A new projected quasi-Newton approach for the nonnegative least squares problem. Tech. rep., Computer Science Department, University of Texas at Austin (2006). https:\/\/pdfs.semanticscholar.org\/1e8c\/118ad4e92c0927b19ec2bcb1ae8623aebde7.pdf"},{"key":"256_CR28","first-page":"69","volume":"44","author":"D Mielczarek","year":"2006","unstructured":"Mielczarek, D.: Minimal projections onto spaces of symmetric matrices. Univ. Iagel. Acta Math. 44, 69\u201382 (2006)","journal-title":"Univ. Iagel. Acta Math."},{"key":"256_CR29","unstructured":"Morales, J.L.: Variational quasi-Newton formulas for systems of nonlinear equations and optimization problems. (2008). http:\/\/users.eecs.northwestern.edu\/~morales\/PSfiles\/PSB.pdf"},{"issue":"3","key":"256_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)"},{"key":"256_CR31","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.laa.2014.11.035","volume":"469","author":"CJ Pang","year":"2015","unstructured":"Pang, C.J.: Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes. Linear Algebra Appl. 469, 419\u2013439 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"256_CR32","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1365-246X.2006.02978.x","volume":"167","author":"RE Plessix","year":"2006","unstructured":"Plessix, R.E.: A review of the adjoint-state method for computing the gradient of a functional with geophysical applications. Geophys. J. Int. 167(2), 495\u2013503 (2006)","journal-title":"Geophys. J. Int."},{"issue":"1\u20132","key":"256_CR33","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10107-011-0510-y","volume":"138","author":"M Powell","year":"2013","unstructured":"Powell, M.: Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. Math. Program. 138(1\u20132), 475\u2013500 (2013)","journal-title":"Math. Program."},{"key":"256_CR34","unstructured":"Powell, M.J.: A new algorithm for unconstrained optimization. In: Nonlinear Programming, pp. 31\u201365. Elsevier (1970). https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780125970501500063"},{"key":"256_CR35","unstructured":"Rheinboldt, W.C.: Quasi-Newton methods. Lecture Notes, TU Munich (2000). https:\/\/www-m2.ma.tum.de\/foswiki\/pub\/M2\/Allgemeines\/SemWs09\/quasi-newt.pdf"},{"issue":"5","key":"256_CR36","doi-asserted-by":"publisher","first-page":"S404","DOI":"10.1137\/16M1082020","volume":"39","author":"K Scheufele","year":"2017","unstructured":"Scheufele, K., Mehl, M.: Robust multisecant Quasi-Newton variants for parallel fluid-structure simulations\u2013and other multiphysics applications. SIAM J. Sci. Comput. 39(5), S404\u2013S433 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"256_CR37","unstructured":"Schnabel, R.B.: Quasi-Newton methods using multiple secant equations. Tech. rep., DTIC Document (1983). http:\/\/www.dtic.mil\/cgi-bin\/GetTRDoc?AD=ADA131444"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00256-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00256-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00256-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T17:32:17Z","timestamp":1614274337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00256-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,12]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00256-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,1,12]]},"assertion":[{"value":"12 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}