Convergence of Trust-Region Algorithms in Metric Spaces
SIAM Journal on Optimization · 30.06.2026 · 36 (2) · 841-865
DOI: 10.1137/24m1718627 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 22.05.2026. Verfasst von Paul Manns. Die Arbeit nennt 27 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Manns, P. (2026). Convergence of Trust-Region Algorithms in Metric Spaces. SIAM Journal on Optimization, 36(2), 841-865. https://doi.org/10.1137/24m1718627
Vancouver
Manns P. Convergence of Trust-Region Algorithms in Metric Spaces. SIAM Journal on Optimization. 2026;36(2):841-865. doi:10.1137/24m1718627
BibTeX
@article{Manns2026,
author = {Manns, Paul},
title = {Convergence of Trust-Region Algorithms in Metric Spaces},
journal = {SIAM Journal on Optimization},
year = {2026},
volume = {36},
number = {2},
pages = {841--865},
doi = {10.1137/24m1718627}
}
EUVIMED