A Smoothing Proximal Gradient Algorithm for Nonsmooth Convex Regression with Cardinality Penalty
Authors:
- Wei BianWBWei Bian
- Xiaojun ChenXCXiaojun Chen
- 1 January 2020
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 58 (1) , 858-883
Abstract
In this paper, we focus on the constrained sparse regression problem, where the loss function is convex but nonsmooth and the penalty term is defined by the cardinality function. First, we give an ...Keywords
Funding Information
- Hong Kong Research Grant Council (153000/17P)
- National Natural Science Foundation of China (11871178, 61773136)
This publication has 51 references indexed in Scilit:
- Smoothing methods for nonsmooth, nonconvex minimizationMathematical Programming, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Nearly unbiased variable selection under minimax concave penaltyThe Annals of Statistics, 2010
- Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical resultsMathematical Programming, 2009
- Restricted isometry properties and nonconvex compressive sensingInverse Problems, 2008
- Asymptotic properties of bridge estimators in sparse high-dimensional regression modelsThe Annals of Statistics, 2008
- Variable Selection via A Combination of theL0andL1PenaltiesJournal of Computational and Graphical Statistics, 2007
- Emergence of simple-cell receptive field properties by learning a sparse code for natural imagesNature, 1996
- Support-vector networksMachine Learning, 1995
- Nondifferentiable optimization via smooth approximation: General analytical approachAnnals of Operations Research, 1992