Solution of l>inf<1>/inf<Minimization Problems by LARS/Homotopy Methods

This work considers l1 minimization by using LARS, Lasso, and homotopy methods and finds that whenever the number k of nonzeros in the sparsest solution is less than d/2log(n) then LARS/homotopy obtains the spARSest solution in k steps each of complexity O(d2).

Abstract

Many applications in signal processing lead to the optimization problems min parxpar 1 subject to y = Ax, and min parxpar 1 subject to pary - Axpar les epsi, where A is a given d times n matrix, d 1 minimization by using LARS, Lasso, and homotopy methods (Efron et al., Tibshirani, Osborne et al.). While these methods were first proposed for use in statistical model selection, we show that under certain conditions these methods find the sparsest solution rapidly, as opposed to conventional general purpose optimizers which are prohibitively slow. We define a phase transition diagram which shows how algorithms behave for random problems, as the ratio of unknowns to equations and the ratio of the sparsity to equations varies. We find that whenever the number k of nonzeros in the sparsest solution is less than d/2log(n) then LARS/homotopy obtains the sparsest solution in k steps each of complexity O(d 2 )