# A Primal-Dual Homotopy Algorithm for L1-Minimization with L-infinity-Constraints

In this paper we propose a primal-dual homotopy method for L1-minimization problems with infinity norm constraints in the context of sparse reconstruction. The natural homotopy parameter is the value of the bound for the constraints and we show that there exists a piecewise linear solution path with finitely many break points for the primal problem and a respective piecewise constant path for the dual problem. We show that by solving a small linear program, one can jump to the next primal break point and then, solving another small linear program, a new optimal dual solution is calculated which enables the next such jump in the subsequent iteration. Using a theorem of the alternative, we show that the method never gets stuck and indeed calculates the whole path in a finite number of steps. Numerical experiments demonstrate the effectiveness of our algorithm. In many cases, our method significantly outperforms commercial LP solvers; this is possible since our approach employs a sequence of considerably simpler auxiliary linear programs that can be solved efficiently with specialized active-set strategies.

Matlab-Code and test instances for our method can be found below.

@article{BrauerLorenzTillmann2018,

author = {C. Brauer and D. A. Lorenz and A. M. Tillmann},

title = {{A Primal-Dual Homotopy Algorithm for $\ell_1$-Minimization with $\ell_\infty$-Constraints}},

journal = {{Computational Optimization and Applications}},

volume = {70},

number = {2},

pages = {443--478},

note = {DOI:10.1007/s10589-018-9983-4},

year = {2018}

}