A novel projection method for split feasibility problems with applications to compressive sensing

DOI10.1007/S40314-023-02332-8MaRDI QIDQ6159820zbMATH OpenOpenAlexFDO

Authors Pham Ky Anh, Nguyen The Vinh

Publication date 22 June 2023

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40314-023-02332-8

zbMATH Keywords

weak convergenceHilbert spacesplit feasibility problemCQ algorithmgradient projection methodhyperplane projection methodPolyak's stepsize

Mathematics Subject Classification ID

Set-valued operators (47H04) Fixed-point theorems (47H10) Variational inequalities (49J40)

Recommendations

• Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
• A projection method for solving the sparsity split feasibility problem
• A new iterative scheme using inertial technique for the split feasibility problem with application to compressed sensing
• A new iterative method for the split feasibility problem
• A novel relaxed projective method for split feasibility problems

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 3853749 (Why is no real title available?)
• scientific article; zbMATH DE number 204196 (Why is no real title available?)
• A New Projection Method for Variational Inequality Problems
• A multiprojection algorithm using Bregman projections in a product space
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• A new self-adaptive CQ algorithm with an application to the LASSO problem
• A note on the CQ algorithm for the split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
• Convergence analysis for proximal split feasibility problems and fixed point problems
• General splitting methods with linearization for the split feasibility problem
• Global and linear convergence of alternated inertial methods for split feasibility problems
• 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
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• New inertial relaxed method for solving split feasibilities
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• 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
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• Split feasibility and fixed point problems
• Strong convergence result for proximal split feasibility problem in Hilbert spaces
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem
• The strong convergence of a three-step algorithm for the split feasibility problem
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• \(l_1\)-\(l_2\) regularization of split feasibility problems

Cited in

(1)

• A proximal splitting method for separable convex programming and its application to compressive sensing

This page was built for publication: A novel projection method for split feasibility problems with applications to compressive sensing

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