Self-adaptive-type CQ algorithms for split equality problems

Convex programming (90C25) Fixed-point theorems (47H10) Numerical methods of relaxation type (49M20) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

A multiprojection algorithm using Bregman projections in a product space
A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
Iterative oblique projection onto convex sets and the split feasibility problem
Fixed points of nonexpanding maps
Approximation of fixed points of pseudocontraction semigroups based on a viscosity iterative process
A relaxed alternating CQ-algorithm for convex feasibility problems
Viscosity approximation methods for fixed-points problems
Solving the split feasibility problem without prior knowledge of matrix norms
Solving the variational inequality problem defined on intersection of finite level sets
Title not available (Why is that?)
Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
Title not available (Why is that?)
Solving the split equality problem without prior knowledge of operator norms
Iterative method with inertial for variational inequalities in Hilbert spaces
Convergence of an extragradient-type method for variational inequality with applications to optimal control problems
A new iterative method for the split common fixed point problem in Hilbert spaces
Common zero point for a finite family of inclusion problems of accretive mappings in Banach spaces
Self-adaptive algorithms for the split problem of the demicontractive operators
Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems
Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
Strong convergence of inertial Mann algorithms for solving hierarchical fixed point problems
Title not available (Why is that?)
A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
Title not available (Why is that?)
Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications
An accelerated hybrid projection method with a self‐adaptive step‐size sequence for solving split common fixed point problems
Weak and Strong Convergence Theorems for New Demimetric Mappings and the Split Common Fixed Point Problem in Banach Spaces

This page was built for publication: Self-adaptive-type CQ algorithms for split equality problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576155)