scientific article; zbMATH DE number 7312306

zbMath1477.47082MaRDI QIDQ5152048

Jing Zhao, Yu'an Li

Publication date: 18 February 2021

Full work available at URL: http://jnva.biemdas.com/archives/1229

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

weak convergencesplit common fixed-point problemquasi-nonexpansive operatorinertial techniqueselfadaptive algorithm

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Cites Work

• A note on the split common fixed-point problem for quasi-nonexpansive operators
• Two projection algorithms for solving the split common fixed point problem
• Convergence theorems for inertial KM-type algorithms
• A multiprojection algorithm using Bregman projections in a product space
• A new method for split common fixed-point problem without priori knowledge of operator norms
• An inertial method for solving split common fixed point problems
• Iterative algorithms for solving the split feasibility problem in Hilbert spaces
• On variable-step relaxed projection algorithm for variational inequalities
• New inertial relaxed method for solving split feasibilities
• Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems
• Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
• Self-adaptive algorithms with inertial effects for solving the split problem of the demicontractive operators
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• A self-adaptive iterative algorithm for the split common fixed point problems
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space
• Qualitative properties of the minimum sum-of-squares clustering problem
• WEAK CONVERGENCE OF A SPLITTING ALGORITHM IN HILBERT SPACES
• Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
• Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators
• Some methods of speeding up the convergence of iteration methods
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item