Fejér* monotonicity in optimization algorithms

Abstract

Fejér monotonicity is a well-established property often observed in sequences generated by optimization algorithms. In this paper, we study an extension of this property, called Fejér* monotonicity, which was initially proposed in [SIAM J. Optim., 34(3), 2535-2556 (2024)]. We discuss and explore its behavior within Hilbert spaces as a tool for optimization algorithms. Additionally, we investigate weak and strong convergence properties of this novel concept. Through illustrative examples and insightful results, we contrast Fejér* with weaker notions of quasi-Fejér-type monotonicity.