Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
From MaRDI portal
Publication:2673529
DOI10.1007/S11590-021-01798-XzbMath1493.90228OpenAlexW3202086379MaRDI QIDQ2673529
Suthep Suantai, Suparat Kesornprom, Prasit Cholamjiak, Bancha Panyanak
Publication date: 10 June 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01798-x
Related Items (3)
Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications ⋮ On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces ⋮ A novel projection method for split feasibility problems with applications to compressive sensing
Cites Work
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Convergence theorems for inertial KM-type algorithms
- A multiprojection algorithm using Bregman projections in a product space
- Compressive sensing in signal processing: algorithms and transform domain formulations
- New inertial relaxed method for solving split feasibilities
- Global and linear convergence of alternated inertial methods for split feasibility problems
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Inertial accelerated algorithms for solving a split feasibility problem
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The Split Common Null Point Problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
