{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:43:34Z","timestamp":1787341414338,"version":"build-2736575974"},"reference-count":49,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0024335"],"award-info":[{"award-number":["DE-SC0024335"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["DE-AC52-07NA27344"],"award-info":[{"award-number":["DE-AC52-07NA27344"]}],"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":["22-ERD-009"],"award-info":[{"award-number":["22-ERD-009"]}],"id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct.\u00a0Multidiscip.\u00a0Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. We refer to the new algorithm as the SiMPL method (pronounced \u201csimple\u201d), which stands for Sigmoidal Mirror descent with a Projected Latent variable.<\/jats:p>","DOI":"10.1137\/24m1708863","type":"journal-article","created":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T03:13:32Z","timestamp":1747883612000},"page":"1134-1164","source":"Crossref","is-referenced-by-count":5,"title":["Analysis of the SiMPL Method for Density-Based Topology Optimization"],"prefix":"10.1137","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6969-6857","authenticated-orcid":true,"given":"Brendan","family":"Keith","sequence":"first","affiliation":[{"name":"Division of Applied Mathematics, Brown University, Providence, RI 02912 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9892-0611","authenticated-orcid":true,"given":"Dohyun","family":"Kim","sequence":"additional","affiliation":[{"name":"Division of Applied Mathematics, Brown University, Providence, RI 02912 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boyan S.","family":"Lazarov","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA 94550 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas M.","family":"Surowiec","sequence":"additional","affiliation":[{"name":"Department of Numerical Analysis and Scientific Computing, Simula Research Laboratory, 0164 Oslo, Norway."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-014-1157-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-018-9394-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11044-005-2530-y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2020.06.009"},{"key":"ref5","first-page":"447","volume":"38","author":"Andrej J.","year":"2024","journal-title":"Internat. J. High Perform. Comput. Appl."},{"key":"ref6","author":"Attouch H.","year":"2014","journal-title":"SIAM"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01915-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S0219199701000524"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01650949"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03115-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(88)90086-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s004190050248"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05086-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12905-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101194"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/fld.426"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0801014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/nme.116"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/14.4.422"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-70914-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934364"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.photonics.2011.10.003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01637664"},{"key":"ref29","first-page":"1","author":"Keith B.","year":"2024","journal-title":"Found. Comput. Math."},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"D. Kim, B. S. Lazarov, T. M. Surowiec, and B. Keith, A simple introduction to the SiMPL method for density-based topology optimization, Struct. Multidiscip. Optim., 68 (2025), 74, https:\/\/doi.org\/10.1007\/s00158-025-04008-9.","DOI":"10.1007\/s00158-025-04008-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3934\/cpaa.2020024"},{"key":"ref32","doi-asserted-by":"crossref","unstructured":"S. G. Krantz and H. R. Parks, The Implicit Function Theorem, 2003, https:\/\/doi.org\/10.1007\/978-1-4612-0059-8.","DOI":"10.1007\/978-1-4612-0059-8"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/nme.3072"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77226-0"},{"key":"ref35","first-page":"154","volume":"4","author":"Martinet B.","year":"1970","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1625"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/19M1298007"},{"key":"ref38","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovskij A. S.","year":"1983"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-015-1381-2"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s001580050176"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620240207"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362822"},{"key":"ref45","unstructured":"K. Svanberg, MMA and GCMMA-two methods for nonlinear optimization, 1 (2007), pp. 1\u201315."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1284-2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7949(01)00126-2"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(91)90046-9"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00092-y"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/24M1708863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:18:01Z","timestamp":1787339881000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M1708863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,22]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1137\/24M1708863"],"URL":"https:\/\/doi.org\/10.1137\/24m1708863","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,22]]}}}