A sensible amount of studies has been dedicated to the achievement of scalable and computational efficient solution of such NP-hard problems [1]}. Popular techniques include
greedy forward/backward stepwise selection [2]}, randomized algorithms [3]}, Mixed Integer Programming based methods [4]} and convex relaxations through bridge regression [5]}.
