Parallel algorithms for variational inclusions and fixed points with applications
, 2014 In this paper, we introduce two parallel algorithms for finding a zero of the sum of two monotone operators and a fixed point of a nonexpansive mapping in Hilbert spaces and prove some strong convergence theorems of the proposed algorithms.
A. A. Abdou +4 more
semanticscholar +1 more source
Iterative algorithms for quasi-variational inclusions and fixed point problems of pseudocontractions
, 2014 In this paper, quasi-variational inclusions and fixed point problems of pseudocontractions are considered. An iterative algorithm is presented. A strong convergence theorem is demonstrated. MSC:49J40, 47J20, 47H09, 65J15.
Yonghong Yao, R. Agarwal, Y. Liou
semanticscholar +1 more source
On the convergence rate of the Kačanov scheme for shear-thinning fluids. [PDF]
Calcolo, 2022 Heid P, Süli E.
europepmc +1 more source
Some results on Rockafellar-type iterative algorithms for zeros of accretive operators
, 2013 We provide a new proof technique to obtain strong convergence of the sequences generated by viscosity iterative methods for a Rockafellar-type iterative algorithm and a Halpern-type iterative algorithm to a zero of an accretive operator in Banach spaces.
J. Jung
semanticscholar +1 more source
On a new semilocal convergence analysis for the Jarratt method
, 2013 We develop a new semilocal convergence analysis for the Jarratt method. Through our new idea of recurrent functions, we develop new sufficient convergence conditions and tighter error bounds.
I. Argyros, Y. Cho, S. Khattri
semanticscholar +1 more source
Convergence Analysis of the Fast Subspace Descent Methods for Convex Optimization Problems
, 2019 The full approximation storage (FAS) scheme is a widely used multigrid method for nonlinear problems. In this paper, a new framework to design and analyze FAS-like schemes for convex optimization problems is developed.
Chen, Long, Hu, Xiaozhe, Wise, Steven M.
core
The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem. [PDF]
J Inequal Appl, 2017 Tian M, Zhang HF.
europepmc +1 more source
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem. [PDF]
J Inequal Appl, 2017 Tian M, Zhang HF.
europepmc +1 more source
Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces. [PDF]
J Inequal Appl, 2018 Yu H, Wang F.
europepmc +1 more source
An optimal adaptive wavelet method for first order system least squares. [PDF]
Numer Math (Heidelb), 2018 Rekatsinas N, Stevenson R.
europepmc +1 more source