Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
type: Item
instance of: scholarly article
title: Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
zbMATH Open document ID: 1487.47120
author: Hai Yu
author: Fenghui Wang
published in: Journal of Inequalities and Applications
publication date: 2022-01-20T00:00:00Z
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 47J20
Mathematics Subject Classification ID: 49N45
Mathematics Subject Classification ID: 65J15
zbMATH DE Number: 7460989
zbMATH Keywords: split equality problem
zbMATH Keywords: alternating CQ algorithm
zbMATH Keywords: variable stepsize
MaRDI profile type: Publication
full work available at URL: s13660-020-02480-z
OpenAlex ID: W3081680958
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: Q3382964
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: Hybrid simultaneous algorithms for the split equality problem with applications
cites work: Self-adaptive projection algorithms for solving the split equality problems
cites work: Solving the split equality problem without prior knowledge of operator norms
cites work: Simultaneous and semi-alternating projection algorithms for solving split equality problems
cites work: Q5142522
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: A relaxed alternating CQ-algorithm for convex feasibility problems
cites work: Q5419228
cites work: On an open question of Moudafi for convex feasibility problems in Hilbert spaces
cites work: A new halfspace-relaxation projection method for the split feasibility problem
cites work: Nonlinear functional analysis. Fixed point theory and its applications
cites work: Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
cites work: A new iterative method for the split common fixed point problem in Hilbert spaces
cites work: On the convergence of CQ algorithm with variable steps for the split equality problem
cites work: Polyak's gradient method for split feasibility problem constrained by level sets
cites work: Iterative Algorithms for Nonlinear Operators
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
cites work: Averaged mappings and the gradient-projection algorithm
cites work: Properties and iterative methods for the lasso and its variants
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: On variable-step relaxed projection algorithm for variational inequalities
cites work: Self-adaptive algorithms for the split problem of the demicontractive operators
DOI: 10.1186/S13660-020-02480-Z
description: scientific article; zbMATH DE number 7460989