A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems

Abstract

In this paper, we consider high-dimensional nonconvex square-root-loss regression problems and introduce a proximal majorization-minimization (PMM) algorithm for these problems. Our key idea for making the proposed PMM to be efficient is to develop a sparse semismooth Newton method to solve the corresponding subproblems. By using the Kurdyka-Łojasiewicz property exhibited in the underlining problems, we prove that the PMM algorithm converges to a d-stationary point. We also analyze the oracle property of the initial subproblem used in our algorithm. Extensive numerical experiments are presented to demonstrate the high efficiency of the proposed PMM algorithm.

arXiv comment34 pages, 8 tables

References in corpus (13)

• Rejoinder to "Least angle regression" by Efron et al
• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Nearly unbiased variable selection under minimax concave penalty
• Templates for Convex Cone Problems with Applications to Sparse Signal Recovery
• Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming

Cited by in corpus (2)

• A proximal MM method for the zero-norm regularized PLQ composite optimization problem
• Multiple Regression for Matrix and Vector Predictors: Models, Theory, Algorithms, and Beyond