Inertial accelerated steepest descent algorithm for generalized split common fixed point problems

90C25: Convex programming

47J25: Iterative procedures involving nonlinear operators

47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
Inertial Douglas-Rachford splitting for monotone inclusion problems
Strong convergence theorems for 2-generalized hybrid mappings in Hilbert spaces
Algorithms for the split variational inequality problem
Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
An iterative method for an infinite family of nonexpansive mappings in Hilbert spaces
On the Mann iteration process in a Hilbert space
An iterative approach to quadratic optimization
Strong convergence of modified Mann iterations
Viscosity approximation methods for fixed-points problems
A novel low-cost method for generalized split inverse problem of finite family of demimetric mappings
Reckoning solution of split common fixed point problems by using inertial self-adaptive algorithms
On split common fixed point problems
General method for solving the split common fixed point problem
Construction of fixed points of nonlinear mappings in Hilbert space
Several iterative algorithms for solving the split common fixed point problem of directed operators with applications
The split common null point problem and the shrinking projection method in Banach spaces
General algorithms for split common fixed point problem of demicontractive mappings
Strong Convergence of a Split Common Fixed Point Problem
Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
Iterative Algorithms for Nonlinear Operators
The multiple-sets split feasibility problem and its applications for inverse problems
The split common fixed-point problem for demicontractive mappings
Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
A unified treatment of some iterative algorithms in signal processing and image reconstruction
The Split Common Null Point Problem
Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
On Projection Algorithms for Solving Convex Feasibility Problems
Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems
Parallel Iterative Methods for Solving the Split Common Fixed Point Problem in Hilbert Spaces
Iterative methods for fixed point problems and generalized split feasibility problems in Banach spaces
DC-Programming versus ℓ₀-Superiorization for Discrete Tomography
Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
A block-iterative surrogate constraint splitting method for quadratic signal recovery
Multiple-set split feasibility problems for a finite family of demicontractive mappings in Hilbert spaces
Signal Recovery by Proximal Forward-Backward Splitting
Some methods of speeding up the convergence of iteration methods
Weak convergence of the sequence of successive approximations for nonexpansive mappings
Mean Value Methods in Iteration
Convex analysis and monotone operator theory in Hilbert spaces
Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning