Pages that link to "Item:Q537241"
From MaRDI portal
The following pages link to Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms (Q537241):
Displaying 11 items.
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit (Q1027254) (← links)
- Algorithms for simultaneous sparse approximation. II: Convex relaxation (Q1027255) (← links)
- Simultaneous nonparametric regression in RADWT dictionaries (Q1727921) (← links)
- Robust detection of neural spikes using sparse coding based features (Q2038824) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- A single gallery-based face recognition using extended joint sparse representation (Q2422966) (← links)
- Group sparse RLS algorithms (Q2800923) (← links)
- A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging (Q4571033) (← links)
- Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference (Q5039993) (← links)
- Iteratively Reweighted Group Lasso Based on Log-Composite Regularization (Q5161764) (← links)
- A generalized formulation for group selection via ADMM (Q6571367) (← links)
