Group Sparsity via Linear-Time Projection
By: Researcher II
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
| Authors | EWOUT, Van Den, Harmen van den Berg, Mark W. Schmidt, Michael P. Friedlander, Kevin Murphy |
| Journal/Conference Name | UBC Technical Report |
| Paper Category | Computer Science |
| Paper Abstract | We present an efficient spectral projected-gradient algorithm for optimization subject to a group `1-norm constraint. Our approach is based on a novel linear-time algorithm for Euclidean projection onto the `1and group `1-norm constraints. Numerical experiments on large data sets suggest that the proposed method is substantially more efficient and scalable than existing methods. |
| Date of publication | 2008 |
| Code Programming Language | MATLAB |
| Comment |
Copyright Researcher II 2021