Inertial relaxed CQ algorithm with an application to signal processing
From MaRDI portal
Publication:3384708
Recommendations
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- scientific article; zbMATH DE number 7399383
- New inertial relaxed method for solving split feasibilities
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Improved relaxed CQ method with inertial accelerated technique for the split feasibility problem
Cites work
- A Halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces
- A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications
- A multiprojection algorithm using Bregman projections in a product space
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Adaptive algorithm for solving the SCFPP of demicontractive operators without a priori knowledge of operator norms
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- Convex analysis and monotone operator theory in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Split common fixed point problems for demicontractive operators
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(11)- scientific article; zbMATH DE number 1791060 (Why is no real title available?)
- scientific article; zbMATH DE number 7475088 (Why is no real title available?)
- scientific article; zbMATH DE number 7475079 (Why is no real title available?)
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- scientific article; zbMATH DE number 7399383 (Why is no real title available?)
- New inertial relaxed method for solving split feasibilities
- scientific article; zbMATH DE number 7560606 (Why is no real title available?)
- A new iterative scheme using inertial technique for the split feasibility problem with application to compressed sensing
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- scientific article; zbMATH DE number 7475087 (Why is no real title available?)
- Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery
This page was built for publication: Inertial relaxed CQ algorithm with an application to signal processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384708)
