scientific article; zbMATH DE number 6847097
From MaRDI portal
Publication:4604753
zbMATH Open1489.47101MaRDI QIDQ4604753FDOQ4604753
Authors: Yonghong Yao, Limin Leng, Mihai Postolache, Xiaoxue Zheng 
Publication date: 5 March 2018
Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol18/p875.html
Title of this publication is not available (Why is that?)
Recommendations
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Applications of Mann's method to the split common fixed point problem
- Mann and Halpern iterations for the split common fixed point problem in Banach spaces
- Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings
- Two iterative algorithms for solving the split common fixed point problems
- Iterative methods for the split common fixed point problem in Hilbert spaces
- General method for solving the split common fixed point problem
- Hybrid iterative algorithms for the split common fixed point problems
- A new iterative method for the split common fixed point problem in Hilbert spaces
- A general iterative method for split common fixed point problem and variational inclusion problem
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point iterations (47J26)
Cited In (29)
- Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- Applications of Mann's method to the split common fixed point problem
- Extragradient methods with \(CQ\) technique for fixed point problems and equilibrium problems
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Iteration process for fixed point problems and zeros of maximal monotone operators
- Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
- Convergence theorem for split feasibility problem, equilibrium problem and zeroes of sum of monotone operators
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- Approximating fixed points of \((\lambda ,\rho)\)-firmly nonexpansive mappings in modular function spaces
- Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints
- Approximation of fixed points for mean nonexpansive mappings in Banach spaces
- Modified Krasnoselski-Mann type iterative algorithm with strong convergence for hierarchical fixed point problem and split monotone variational inclusions
- Iterative solutions for solving variational inequalities and fixed-point problems
- A self-adaptive extragradient algorithm for solving quasimonotone variational inequalities
- On the split common fixed point problem for strict quasi-\(\phi\)-pseudocontractive mappings in Banach spaces
- Composite steepest-descent method for the triple hierarchical variational inequalities
- Some convergence results using \(K\) iteration process in CAT(0) spaces
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Fixed point algorithms for the split problem of demicontractive operators
- Cayley approximation operator with an application to a system of set-valued Cayley type inclusions
- Split common fixed point problems for demicontractive operators
- Two iterative algorithms for solving the split common fixed point problems
- A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings
- Fixed point approximation of monotone nonexpansive mappings in hyperbolic spaces
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- Self-adaptive algorithms for the split problem of the demicontractive operators
- A forward-backward-forward algorithm for solving quasimonotone variational inequalities
- Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604753)
