Active set strategy for high-dimensional non-convex sparse optimization problems
Lists
Only you see this
Abstract
The use of non-convex sparse regularization has attracted much interest when estimating a very sparse model on high dimensional data. In this work we express the optimality conditions of the optimization problem for a large class of non-convex regularizers. From those conditions, we derive an efficient active set strategy that avoids the computing of unnecessary gradients. Numerical experiments on both generated and real life datasets show a clear gain in computational cost w.r.t. the state of the art when using our method to obtain very sparse solutions.
BibTeX
@inproceedings{boisbunon2014active,
author = {Aurelie Boisbunon and Rémi Flamary and Alain Rakotomamonjy},
title = {{Active set strategy for high-dimensional non-convex sparse optimization problems}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2014},
doi = {10.1109/icassp.2014.6853851},
}Loading related content...