Linear convergence and support recovery for non-convex multi-penalty regularization

08/07/2019 ∙ by Zeljko Kereta, et al. ∙ 0

We provide a comprehensive convergence study of the iterative multi-penalty q-thresholding algorithm, with 0<q≤ 1, for recovery of a signal mixture. Leveraging recent results in optimisation, signal processing, and regularization, we present novel results on linear convergence of iterates to local minimizers for studied non-convex multi-penalty functionals. We also provide explicitly compute the convergence constant and establish its dependence with respect to the measurement matrix and parameters of the problem. Finally, we present extensive numerical results, that confirm the theoretical findings, and compare the efficiency of the iterative multi-penalty thresholding algorithm with single-penalty counterpart.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.