Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications

DOI10.1007/S12190-023-01875-7MaRDI QIDQ6046874zbMATH OpenFDO

Authors Tong Ling, Xiaolei Tong, Luoyi Shi

Publication date 6 October 2023

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

strong convergencesplit feasibility problemself-adaptiverelaxed CQ Algorithm

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Inverse problems in optimal control (49N45) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Improved relaxed CQ methods for solving the split feasibility problem
• Note on the modified relaxation CQ algorithm for the split feasibility problem

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces
• Double projection algorithms for solving the split feasibility problems
• Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
• General splitting methods with linearization for the split feasibility problem
• Global and linear convergence of alternated inertial methods for split feasibility problems
• Implicit and explicit algorithms for solving the split feasibility problem
• Inertial accelerated algorithms for solving a split feasibility problem
• Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
• New inertial relaxed method for solving split feasibilities
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• Solving the split feasibility problem without prior knowledge of matrix norms
• Solving the variational inequality problem defined on intersection of finite level sets
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem

Cited in

(6)

• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Improved relaxed CQ methods for solving the split feasibility problem
• Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• scientific article; zbMATH DE number 7399383 (Why is no real title available?)
• scientific article; zbMATH DE number 6876349 (Why is no real title available?)

This page was built for publication: Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications

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