The _2,q regularized group sparse optimization: lower bound theory, recovery bound and algorithms
From MaRDI portal
Publication:778013
DOI10.1016/J.ACHA.2020.04.002zbMATH Open1448.94058OpenAlexW3021333344MaRDI QIDQ778013FDOQ778013
Authors: X. Feng, Shi Yan, Chunlin Wu 
Publication date: 30 June 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2020.04.002
Recommendations
- Group sparse optimization via \(\ell_{p,q}\) regularization
- An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
- Robust group lasso: model and recoverability
- Sparse recovery by the iteratively reweighted \(\ell_1\) algorithm for elastic \(\ell_2-\ell_q\) minimization
- scientific article; zbMATH DE number 6747340
Ridge regression; shrinkage estimators (Lasso) (62J07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Simultaneous analysis of Lasso and Dantzig selector
- Analysis of multi-stage convex relaxation for sparse regularization
- Model Selection and Estimation in Regression with Grouped Variables
- The Group Lasso for Logistic Regression
- Decoding by Linear Programming
- Title not available (Why is that?)
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Geometric categories and o-minimal structures
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Compressed sensing and best \(k\)-term approximation
- Clarke Subgradients of Stratifiable Functions
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Iteratively reweighted least squares minimization for sparse recovery
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Title not available (Why is that?)
- Iterative thresholding for sparse approximations
- On gradients of functions definable in o-minimal structures
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The restricted isometry property and its implications for compressed sensing
- Atomic decomposition by basis pursuit
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Shifting Inequality and Recovery of Sparse Signals
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Robust Recovery of Signals From a Structured Union of Subspaces
- Empirical Bayes Estimation of a Sparse Vector of Gene Expression Changes
- Compressed sensing of color images
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Group sparse optimization via $\ell_{p,q}$ regularization
Cited In (14)
- The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- Group sparse structural smoothing recovery: model, statistical properties and algorithm
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration
- Non-Lipschitz variational models and their iteratively reweighted least squares algorithms for image denoising on surfaces
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm
- Title not available (Why is that?)
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
Uses Software
This page was built for publication: The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778013)
