Fast L1-L2 minimization via a proximal operator
Abstract
This paper aims to develop new and fast algorithms for recovering a sparse vector from a small number of measurements, which is a fundamental problem in the field of compressive sensing (CS). Currently, CS favors incoherent systems, in which any two measurements are as little correlated as possible. In reality, however, many problems are coherent, and conventional methods such as minimization do not work well. Recently, the difference of the and norms, denoted as -, is shown to have superior performance over the classic method, but it is computationally expensive. We derive an analytical solution for the proximal operator of the - metric, and it makes some fast solvers such as forward-backward splitting (FBS) and alternating direction method of multipliers (ADMM) applicable for -. We describe in details how to incorporate the proximal operator into FBS and ADMM and show that the resulting algorithms are convergent under mild conditions. Both algorithms are shown to be much more efficient than the original implementation of - based on a difference-of-convex approach in the numerical experiments.
Cite
@article{arxiv.1609.09530,
title = {Fast L1-L2 minimization via a proximal operator},
author = {Yifei Lou and Ming Yan},
journal= {arXiv preprint arXiv:1609.09530},
year = {2017}
}