Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated and inexact forward-backward algorithms
- Optimization with sparsity-inducing penalties
- Proximal methods for the latent group lasso penalty
- Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
- Sparse inverse covariance estimation with the graphical lasso
- Structured variable selection with sparsity-inducing norms
- The Adaptive Lasso and Its Oracle Properties
Cited in
(4)
This page was built for publication: Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185635)