Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
From MaRDI portal
Publication:2411691
DOI10.1007/s00034-017-0532-7zbMath1373.94725OpenAlexW2601647492MaRDI QIDQ2411691
Publication date: 25 October 2017
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0532-7
compressed sensinggradient projectionsmoothing approximationneural network optimization\(\ell_{1-p}\) minimization
Neural networks for/in biological studies, artificial life and related topics (92B20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction, A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises, A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization, Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model, Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization, New regularization method and iteratively reweighted algorithm for sparse vector recovery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A mathematical introduction to compressive sensing
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Smoothing methods for nonsmooth, nonconvex minimization
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Finite-horizon \(H_{\infty }\) fault estimation for linear discrete time-varying systems with delayed measurements
- Thresholding-based iterative selection procedures for model selection and shrinkage
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Atomic Decomposition by Basis Pursuit
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Optimization and nonsmooth analysis
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Sparse Approximate Solutions to Linear Systems
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Sparse Approximation via Penalty Decomposition Methods
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Compressed sensing
