{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:41:20Z","timestamp":1787341280509,"version":"build-2736575974"},"reference-count":27,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Trust-region algorithms can be applied to very abstract optimization problems because they do not require a specific direction of descent or gradient. This has lead to recent interest in them, in particular in the area of integer optimal control problems, where the infinite-dimensional problem formulations do not assume vector space structure. We analyze a trust-region algorithm in the abstract setting of a metric space, a setting in which integer optimal control problems with total variation regularization can be formulated. Our analysis avoids a reset of the trust-region radius upon acceptance of the iterates when proving convergence to stationary points. This reset has been present in previous analyses of trust-region algorithms for integer optimal control problems. Our computational benchmark shows that the runtime can be considerably improved when avoiding this reset, which is now theoretically justified.<\/jats:p>","DOI":"10.1137\/24m1718627","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T08:01:11Z","timestamp":1779436871000},"page":"841-865","source":"Crossref","is-referenced-by-count":0,"title":["Convergence of Trust-Region Algorithms in Metric Spaces"],"prefix":"10.1137","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0654-6613","authenticated-orcid":true,"given":"Paul","family":"Manns","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, TU Dortmund University, 44227 Dortmund, Germany."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2026,5,22]]},"reference":[{"key":"ref1","volume-title":"Sobolev Spaces","author":"Adams R. A.","year":"2003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198502456.001.0001"},{"key":"ref3","unstructured":"R. Baraldi and P. Manns, Domain Decomposition for Integer Optimal Control with Total Variation Regularization, preprint, arXiv:2410.15672, https:\/\/arxiv.org\/abs\/2410.15672, 2024."},{"key":"ref4","unstructured":"I. A. Barrata, J. P. Dean, J. S. Dokken, M. Habera, J. Hale, C. Richardson, M. E. Rognes, M. W. Scroggs, N. Sime, and G. N. Wells, DOLFINx: The next generation fenics problem solving environment, https:\/\/doi.org\/10.5281\/zenodo.10447665, 2023."},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"A. Bemporad, A. Giua, and C. Seatzu, A master-slave algorithm for the optimal control of continuous-time switched affine systems, in Proceedings of the 41st IEEE Conference on Decision and Control 2002, Vol. 2, IEEE, 2002, pp. 1976\u20131981.","DOI":"10.1109\/CDC.2002.1184817"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01581-3"},{"key":"ref7","unstructured":"C. Buchheim, A. Gr\u00fctering, and C. Meyer, Parabolic Optimal Control Problems with Combinatorial Switching Constraints\u2013Part III: Branch-and-bound Algorithm, preprint, https:\/\/arxiv.org\/abs\/2401.10018, 2024."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2023.110967"},{"key":"ref9","volume-title":"SIAM","author":"Conn A. R.","year":"2000"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2920425"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S105262340038081X"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"S. Gau, T. Leifeld, and P. Zhang, A novel and fast mpc based control strategy for switched linear systems including soft switching cost, in Proceedings of the 2017 IEEE 56th Annual Conference on Decision and Control (CDC), IEEE, 2017, pp. 6513\u20136518.","DOI":"10.1109\/CDC.2017.8264640"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01733-z"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"C. Kirches, E. A. Kostina, A. Meyer, and M. Schl\u00f6der, Generation of optimal walking-like motions using dynamic models with switches, switch costs, and state jumps, in Proceedings of the 2019 IEEE 58th Conference on Decision and Control (CDC), IEEE, 2019, pp. 1538\u20131543.","DOI":"10.1109\/CDC40024.2019.9029577"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/20M1370501"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582565"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1051\/cocv\/2022059"},{"key":"ref18","first-page":"1","volume":"4","author":"Manns P.","year":"2023","journal-title":"J. Nonsmooth Anal. Optim."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/22M152116X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1051\/cocv\/2023065"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00244-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2023.1294"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-020-09536-5"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"19786","DOI":"10.52202\/068431-1438","volume":"35","author":"Terpin A.","year":"2022","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.2.231"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614518"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/24M1718627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:12:30Z","timestamp":1787339550000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M1718627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,22]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1137\/24M1718627"],"URL":"https:\/\/doi.org\/10.1137\/24m1718627","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,22]]}}}