A moving ball projection algorithm for the split feasibility problem

DOI10.1016/J.JMAA.2026.130600MaRDI QIDQ6833880zbMATH OpenFDO

Authors Wan-rong Zhan, Hai Yu, Fenghui Wang

Publication date 1 April 2026

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JMAA.2026.130600

zbMATH Keywords

split feasibility problemrelaxed CQ algorithmmoving ball projection

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Equations and inequalities involving nonlinear operators (47Jxx) Numerical analysis in abstract spaces (65Jxx)

Cites work

• scientific article; zbMATH DE number 6025203 (Why is no real title available?)
• A moving balls approximation method for a class of smooth constrained minimization problems
• A multiprojection algorithm using Bregman projections in a product space
• A new halfspace-relaxation projection method for the split feasibility problem
• A new low-cost feasible projection algorithm for pseudomonotone variational inequalities
• A note on the CQ algorithm for the split feasibility problem
• A relaxed alternating CQ-algorithm for convex feasibility problems
• A relaxed projection method for variational inequalities
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• 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
• An adaptive and expanded framework for multiple-operator split common fixed point problems
• Averaged mappings and the gradient-projection algorithm
• Convex analysis and monotone operator theory in Hilbert spaces
• Inexact implicit methods for monotone general variational inequalities
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the convergence of CQ algorithm with variable steps for the split equality problem
• On variable-step relaxed projection algorithm for variational inequalities
• Polyak's gradient method for split feasibility problem constrained by level sets
• 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
• The split feasibility problem with multiple output sets for demicontractive mappings

This page was built for publication: A moving ball projection algorithm for the split feasibility problem

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