Related papers: On the metric resolvent: nonexpansiveness, converg…
Many descent algorithms for multiobjective optimization have been developed in the last two decades. Tanabe et al. (Comput Optim Appl 72(2):339--361, 2019) proposed a proximal gradient method for multiobjective optimization, which can solve…
In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the…
We consider the Schr\"odinger operator on a combinatorial graph consisting of a finite graph and a finite number of discrete half-lines, all jointed together, and compute an asymptotic expansion of its resolvent around the threshold $0$.…
Firmly nonexpansive mappings play an important role in metric fixed point theory and optimization due to their correspondence with maximal monotone operators. In this paper we do a thorough study of fixed point theory and the asymptotic…
In this paper we provide the resolvent computation of the parallel composition of a maximally monotone operator by a linear operator under mild assumptions. Connections with a modification of the warped resolvent are provided. In the…
We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
We study the resolvent norm of a certain class of closed linear operators on a Hilbert space, including unbounded operators with compact resolvent. It is shown that for any point in the resolvent set there exist directions in which the norm…
We study a stochastically perturbed version of the well-known Krasnoselski--Mann iteration for computing fixed points of nonexpansive maps in finite dimensional normed spaces. We discuss sufficient conditions on the stochastic noise and…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
In the paper, we introduce several accelerate iterative algorithms for solving the multiple-set split common fixed-point problem of quasi-nonexpansive operators in real Hilbert space. Based on primal-dual method, we construct several…
This paper provides a new way of developing the splitting method which is used to solve the problem of finding the resolvent of the sum of maximal monotone operators in Hilbert spaces. By employing accelerated techniques developed by Davis…
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…
In this paper, we study a new iterative method for finding the fixed point of a weak Bregman relatively nonexpansive mapping and the set of solutions of generalized mixed equilibrium problems in Banach spaces.
We introduce and investigate an iterative scheme for approximating common fixed point of a family of Bregman relatively-nonexpansive mappings in real reflexive Banach spaces. We prove strong convergence theorem of the sequence generated by…
In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…
The correspondence between the class of nonexpansive mappings and the class of maximally monotone operators via the reflected resolvents of the latter has played an instrumental role in the convergence analysis of the splitting methods.…
In [1], it is established that a convergent observer with an infinite gain margin can be designed for a given nonlinear system when a Riemannian metric showing that the system is differentially detectable (i.e., the Lie derivative of the…
We consider the convergence of iterative solvers for problems of nonlinear magnetostatics. Using the equivalence to an underlying minimization problem, we can establish global linear convergence of a large class of methods, including the…
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by averaged operators in a Hilbert space. Our results are achieved under a bounded H\"older regularity assumption which generalizes the…