Inertial relaxed CQ algorithm with an application to signal processing
zbMATH Open1489.65075MaRDI QIDQ3384708FDOQ3384708
Authors: Duangkamon Kitkuan, Kanikar Muangchoo 
Publication date: 17 December 2021
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/4753
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
Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical solutions to equations with nonlinear operators (65J15) Applications of operator theory in systems, signals, circuits, and control theory (47N70)
Cites Work
- Convex analysis and monotone operator theory in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Split common fixed point problems for demicontractive operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications
- A Halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
- Adaptive algorithm for solving the SCFPP of demicontractive operators without a priori knowledge of operator norms
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- Title not available (Why is that?)
- New inertial relaxed method for solving split feasibilities
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery
- Title not available (Why is that?)
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)
