English

A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations

Optimization and Control 2019-02-15 v2

Abstract

For the problem of sparse recovery, it is widely accepted that nonconvex minimizations are better than 1\ell_1 penalty in enhancing the sparsity of solution. However, to date, the theory verifying that nonconvex penalties outperform (or are at least as good as) 1\ell_1 minimization in exact, uniform recovery has mostly been limited to separable cases. In this paper, we establish general recovery guarantees through null space conditions for nonconvex, non-separable regularizations, which are slightly less demanding than the standard null space property for 1\ell_1 minimization.

Keywords

Cite

@article{arxiv.1710.07348,
  title  = {A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations},
  author = {Hoang Tran and Clayton Webster},
  journal= {arXiv preprint arXiv:1710.07348},
  year   = {2019}
}

Comments

16 pages