Related papers: Parallel methods for quasinonexpansive mappings in…
Aussel et al. (J Optim Theory Appl 170 818-837 2016) introduced the concept of projected solutions for the quasi-variational inequalities with a non-self constraint map, that is, the case where the constraint map may take values outside the…
This paper presents a modified general viscosity iterative process designed to solve variational inclusion and fixed point problems involving multi-valued quasi-nonexpansive and demi-contractive operators. The modified iterative process…
In this paper, we first introduce an iterative process in modular function spaces and then extend the idea of a {\lambda}-firmly nonexpansive mapping from Banach spaces to modular function spaces. We call such mappings as…
In this article, we introduce and investigate the concept of partial quasi-metric type space as a generalization of both partial quasi-metric and quasi-metric type spaces. We show that many important constructions studied in K\"unzi's…
In this short note, we obtain partial quasi-metric versions of Kannan's fixed point theorem for self-mappings. Moreover, we use these fixed points results to characterize a certain type of completeness in partial quasi-metric spaces. We…
We present two parallel optimization algorithms for a convex function $f$. The first algorithm optimizes over linear inequality constraints in a Hilbert space, $\mathbb H$, and the second over a non convex polyhedron in $\mathbb R^n$. The…
This paper investigates a Halpern acceleration of the inexact proximal point method for solving maximal monotone inclusion problems in Hilbert spaces. The proposed Halpern inexact proximal point method (HiPPM) is shown to be globally…
It is generally known that in order to solve the split equality fixed-point problem (SEFPP), it is necessary to compute the norm of bounded and linear operators, which is a challenging task in real life, to address this issue, we studied…
The Krasnosel'ski\u{\i}--Mann and Halpern iterations are classical schemes for approximating fixed points of nonexpansive mappings in Banach spaces, and have been widely studied in more general frameworks such as $CAT(\kappa)$ and, more…
In this paper, we consider a new iteration process which is faster than all of Picard, Mann, Ishikawa and Agarwal et al. processes. We also prove some strong and weak convergence theorems for the class of nonexpansive mappings in Banach…
This paper presents an approach for obtaining approximate solutions to quasi-variational inequalities in a real Hilbert space by modifying Tseng's scheme, which was originally designed for variational inequalities. The study explores the…
Suppose that $Q$ is a family of seminorms on a locally convex space $E$ which determines the topology of $E$. In this paper, first we define the notation of the $q$-duality mappings in locally convex spaces. Then we introduce an implicit…
We investigate the rate of convergence of the iterates of an n-dimensional quasiregular mapping within the basin of attraction of a fixed point of high local index. A key tool is a refinement of a result that gives bounds on the distortion…
In this paper we present a systematic study of regular sequences of quasi-nonexpansive operators in Hilbert space. We are interested, in particular, in weakly, boundedly and linearly regular sequences of operators. We show that the type of…
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.
To solve non-Hermitian linear system Ax=b on parallel and vector machines, some paralell multisplitting methods are considered. In this work, in particular: i) We establish the convergence results of the paralell multisplitting methods,…
By the Riemann-mapping theorem, one can bijectively map the interior of an $n$-gon $P$ to that of another $n$-gon $Q$ conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of $P$ to those $Q$.…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
Many recently proposed gradient projection algorithms with inertial extrapolation step for solving quasi-variational inequalities in Hilbert spaces are proven to be strongly convergent with no linear rate given when the cost operator is…
The main objective of this article is to provide an alternative approach to the central result of [Eldred, A. Anthony, Kirk, W. A., Veeramani, P., Proximal normal structure and relatively nonexpansive mappings, Studia Math., vol 171(3),…