Related papers: A Simple proof for the algorithms of relaxed $(u, …
We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of…
Computational imaging has been revolutionized by compressed sensing algorithms, which offer guaranteed uniqueness, convergence, and stability properties. Model-based deep learning methods that combine imaging physics with learned…
We consider the relaxation of polyconvex functionals with linear growth with respect to the strict convergence in the space of functions of bounded variation. These functionals appears as relaxation of $F(u,\Omega):=\int_\Omega f(\nabla…
In this paper, we study $\Delta$- convergence of iterations for a sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them in Hadamard spaces. Then, we give some their…
This paper establishes new common fixed point theorems for weakly compatible mappings in metric spaces, relaxing traditional requirements such as continuity, compatibility, and reciprocal continuity. We present a unified framework for three…
This paper is concerned with the study of a family of fixed point iterations combining relaxation with different inertial (acceleration) principles. We provide a systematic, unified and insightful analysis of the hypotheses that ensure…
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More…
In this paper, we introduce two new modified inertial Mann Halpern and viscosity algorithms for solving fixed point problems. We establish strong convergence theorems under some suitable conditions. Finally, our algorithms are applied to…
Firstly, we invoke the weak convergence (resp. strong convergence) of translated basic methods involving nonexpansive operators to establish the weak convergence (resp. strong convergence) of the associated method with both perturbation and…
We prove the existence of common fixed points for three selfmaps $T,f$ and $g$ defined on a metric space $(X,d)$ satisfying, $T$ is $(f,g)$-weakly contractive; and the pairs $(T,f)$ and $(T,g)$ are weakly compatible. Also, for such $T,f$…
In this paper, we introduce a new iteration method and show that this iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that the new iteration method is equivalent to both Mann…
In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…
We study alternating first-order algorithms with no inner loops for solving nonconvex-strongly-concave min-max problems. We show the convergence of the alternating gradient descent--ascent algorithm method by proposing a substantially…
The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…
In this paper, we study a new iterative method for a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the frame work of reflexive real Banach spaces. Moreover, we prove the strong convergence theorem for…
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…
A family of random matrices $\boldsymbol{X}^N=(X_1^N,\ldots,X_d^N)$ is said to converge strongly to a family of bounded operators $\boldsymbol{x}=(x_1,\ldots,x_d)$ when $\|P(\boldsymbol{X}^N,\boldsymbol{X}^{N*})\|\to\|P(\boldsymbol{x},…
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and…
In this paper, we consider the Halpern iteration scheme for a finite family of quasinonexpansive mappings and then prove a strong convergence theorem to their common fixed point in a complete geodesic space with curvature bounded above by…
In this paper, we introduce a new modified Ishikawa iteration for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of generalized hybrid mappings in a Hilbert space. Our results…