arXiv Analytics

Sign in

arXiv:2410.08331 [math.OC]AbstractReferencesReviewsResources

Fejér* monotonicity in optimization algorithms

Roger Behling, Yunier Bello-Cruz, Alfredo Noel Iusem, Ademir Alves Ribeiro, Luiz-Rafael Santos

Published 2024-10-10Version 1

Fej\'er monotonicity is a well-established property commonly observed in sequences generated by optimization algorithms. In this paper, we introduce an extension of this property, called Fej\'er* monotonicity, which was initially proposed in [SIAM J. Optim., 34(3), 2535-2556 (2024)]. We discuss and build upon the concept by exploring its behavior within Hilbert spaces, presenting an illustrative example and insightful results regarding weak and strong convergence. We also compare Fej\'er* monotonicity with other weak notions of Fej\'er-like monotonicity, to better establish the role of Fej\'er* monotonicity in optimization algorithms.

Related articles: Most relevant | Search more
arXiv:1709.08242 [math.OC] (Published 2017-09-24)
Best practices for comparing optimization algorithms
arXiv:2411.17329 [math.OC] (Published 2024-11-26)
Strong convergence and fast rates for systems with Tikhonov regularization
arXiv:2410.14369 [math.OC] (Published 2024-10-18)
Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay