An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint

Abstract

Listen

Translate article

The -regularized minimization has been widely used in many data science applications, and certain special constrained -regularized minimizations have also been proposed in some recent applications. In this paper, we consider a sphere constrained -regularized minimization, which can arise in image processing, signal recognition and sparse principal component analysis. Viewing the sphere as a simple Riemannian manifold, manifold-based methods for non-smooth minimization can be applied to solve such a problem, but may still encounter slow convergence in some situations. Our objective of this paper is to propose a new and efficient active-set proximal quasi-Newton method for this problem. The idea behind is to speed up the convergence by separately handling the convergence of both the active and inactive variables. In particular, our method invokes a procedure to effectively estimate active and inactive variables, and then designs the search directions based on proximal gradients and quasi-Newton directions to efficiently treat the convergence of the active and inactive variables, respectively. We show that under some mild conditions, the global convergence is guaranteed, and the complexity is also performed to reveal the computational efficiency. Numerical experience on the -regularized quadratic programming and sparse principal component analysis on both synthetic and real data demonstrates its robustness and efficiency.