Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
From MaRDI portal
Publication:6160613
Recommendations
- A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
- 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 7652674
- A neurodynamic algorithm for sparse signal reconstruction with finite-time convergence
- Sparse signal reconstruction via collaborative neurodynamic optimization
Cites work
- scientific article; zbMATH DE number 48893 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 917233 (Why is no real title available?)
- A dynamical system method for solving the split convex feasibility problem
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Convergence rates for forward-backward dynamical systems associated with strongly monotone inclusions
- Convex analysis and monotone operator theory in Hilbert spaces
- Dynamical systems and forward-backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Just relax: convex programming methods for identifying sparse signals in noise
- Matching Pursuit LASSO Part II: Applications and Sparse Recovery Over Batch Signals
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Second order forward-backward dynamical systems for monotone inclusion problems
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(1)
This page was built for publication: Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160613)