Related papers: Generalized Fej\'er monotone sequences and their f…
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…
In this paper we introduce a localized and relativized generalization of the usual concept of Fej\'er monotonicity together with uniform and quantitative versions thereof and show that the main quantitative results obtained by the 1st…
We provide quantitative information in the form of a rate of metastability in the sense of T. Tao and (under a metric regularity assumption) a rate of convergence for an algorithm approximating zeros of differences of maximally monotone…
We provide quantitative convergence results for continuous-time dynamical systems in metric spaces that satisfy a continuous-time analog of quasi-Fej\'er monotonicity. More precisely, we provide a (strong) convergence result for such…
We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…
We provide a convergence result for sequences of random variables taking values in a metric space that satisfy a stochastic quasi-Fej\'er monotonicity condition, in the context of a (local) compactness assumption. Our result is quantitative…
In this paper we introduce the concept of modulus of regularity as a tool to analyze the speed of convergence, including the finite termination, for classes of Fej\'er monotone sequences which appear in fixed point theory, monotone operator…
Fej\'er 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\'er* monotonicity, which was initially proposed in [SIAM…
Many algorithms in convex optimization and variational analysis can be analyzed using Fej\'er monotone sequences. In 2024, Behling, Bello-Cruz, Iusem, Alves Ribeiro, and Santos introduced a new, more general, notion: Fej\'er* monotonicity.…
The notion of Fej\'er monotonicity has proven to be a fruitful concept in fixed point theory and optimization. In this paper, we present new conditions sufficient for convergence of Fej\'er monotone sequences and we also provide…
We introduce a notion of variable quasi-Bregman monotone sequence which unifies the notion of variable metric quasi-Fej\'er monotone sequences and that of Bregman monotone sequences. The results are applied to analyze the asymptotic…
The notion of quasi-Fej\'er monotonicity has proven to be an efficient tool to simplify and unify the convergence analysis of various algorithms arising in applied nonlinear analysis. In this paper, we extend this notion in the context of…
Recently, a new distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function, this distance…
The notion of Fej\'er monotonicity is instrumental in unifying the convergence proofs of many iterative methods, such as the Krasnoselskii-Mann iteration, the proximal point method, the Douglas-Rachford splitting algorithm, and many others.…
In this manuscript, we claim that the newly introduced $\mathcal{F}$-metric space \cite[\, M.~Jleli and B.~Samet, On a new generalization of metric spaces, J. Fixed Point Theory Appl, 20(3) 2018]{JS1} is metrizable. Also, we deduce that the…
We use techniques originating from the subdiscipline of mathematical logic called `proof mining' to provide rates of metastability and - under a metric regularity assumption - rates of convergence for a subgradient-type algorithm solving…
We compute uniform rates of metastability for the Ishikawa iteration of a Lipschitz pseudo-contractive self-mapping of a compact convex subset of a Hilbert space. This extraction is an instance of the proof mining program that aims to apply…
Recently, we systematically studied the basic theory of Bregman circumcenters in another paper. In this work, we aim to apply Bregman circumcenters to optimization algorithms. Here, we propose the forward Bregman monotonicity which is a…
The article studies the convergence of trigonometric Fourier series via a new Tauberian theorem for Ces\`{a}ro summable series in abstract normed spaces. This theorem generalizes some known results of Hardy and Littlewood for number series.…
We provide a general theorem on the asymptotic behavior of stochastic processes that conform to a relaxed supermartingale condition. The distinguishing feature of our result is that it provides quantitative convergence guarantees at a much…