Effcient Projection Onto the Nonconvex ℓ_p-ball

01/05/2021

∙

by   Hao Wang, et al.

∙

8

∙

share

This paper primarily focuses on computing the Euclidean projection of a vector onto the ℓ_p-ball with p∈(0,1). Such a problem emerges as the core building block in many signal processing and machine learning applications because of its ability to promote sparsity, yet it is challenging to solve due to its nonconvex and nonsmooth nature. First-order necessary optimality conditions of this problem are derived using Fréchet normal cone. We develop a novel numerical approach for computing the stationary point through solving a sequence of projections onto the reweighted ℓ_1-balls. This method is shown to converge uniquely under mild conditions and has a worst-case O(1/√(k)) convergence rate. Numerical experiments demonstrate the efficiency of our proposed algorithm.