A novel relaxed method for the split feasibility problem in Hilbert spaces

DOI10.1007/S41980-024-00961-1MaRDI QIDQ6928092zbMATH OpenFDO

Authors Wan-rong Zhan, Hai Yu

Publication date 17 September 2025

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S41980-024-00961-1

zbMATH Keywords

CQ algorithmhalf-spaceintersection of two half-spacessplit feasibility problem

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Convex programming (90C25)

Cites work

• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• A new halfspace-relaxation projection method for the split feasibility problem
• A new relaxed method for the split feasibility problem in Hilbert spaces
• A note on the CQ algorithm for the split feasibility problem
• A note on the multiple-set split convex feasibility problem in Hilbert space
• A relaxed alternating CQ-algorithm for convex feasibility problems
• A splitting-relaxed projection method for solving the split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Alternating CQ-algorithms for convex feasibility and split fixed-point problems
• Averaged mappings and the gradient-projection algorithm
• Convex analysis and monotone operator theory in Hilbert spaces
• scientific article; zbMATH DE number 3853749 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 7416599 (Why is no real title available?)
• scientific article; zbMATH DE number 6025203 (Why is no real title available?)
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Properties and iterative methods for the lasso and its variants
• Quasi-Fejérian analysis of some optimization algorithms
• Selective projection methods for solving a class of variational inequalities
• Solving the split feasibility problem without prior knowledge of matrix norms
• The ball-relaxed CQ algorithms for the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• Two new self-adaptive algorithms for solving the split feasibility problem in Hilbert space
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces

Cited in

(1)

• Adaptive relaxation algorithms for split equality problems via projections onto intersections of half-spaces

This page was built for publication: A novel relaxed method for the split feasibility problem in Hilbert spaces

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