Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
type: Item
instance of: scholarly article
title: Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
zbMATH Open document ID: 1386.90116
author: Hongcheng Liu
author: Tao Yao
author: Yinyu Ye
author: Runze Li
published in: Mathematical Programming. Series A. Series B
publication date: 2017-12-01T00:00:00Z
full work available at URL: pmc5720392
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 62J05
Mathematics Subject Classification ID: 62J07
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6814728
zbMATH Keywords: sparse recovery
zbMATH Keywords: non-convex programming
zbMATH Keywords: NP-completeness
zbMATH Keywords: folded concave penalty
zbMATH Keywords: lasso
MaRDI profile type: Publication
OpenAlex ID: W2587436146
Wikidata QID: Q47263899
cites work: Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
cites work: Least quantile regression via modern optimization
cites work: Complexity of penalized likelihood estimation
cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
cites work: Simultaneous analysis of Lasso and Dantzig selector
cites work: Decoding by Linear Programming
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Nonconcave Penalized Likelihood With NP-Dimensionality
cites work: Strong oracle optimality of folded concave penalized estimation
cites work: Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
cites work: Variable selection using MM algorithms
cites work: Random design analysis of ridge regression
cites work: A tail inequality for quadratic forms of subgaussian random vectors
cites work: Global solutions to folded concave penalized nonconvex learning
cites work: Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
cites work: A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
cites work: Cubic regularization of Newton method and its global performance
cites work: Restricted eigenvalue properties for correlated Gaussian designs
cites work: Reconstruction From Anisotropic Random Measurements
cites work: Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
cites work: Q4864293
cites work: On the conditions used to prove oracle results for the Lasso
cites work: Quadratic programming is in NP
cites work: How close is the sample covariance matrix to the actual covariance matrix?
cites work: Calibrating nonconvex penalized regression in ultra-high dimension
cites work: On affine scaling algorithms for nonconvex quadratic programming
cites work: On the complexity of approximating a KKT point of quadratic programming
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: A general theory of concave regularization for high-dimensional sparse estimation problems
cites work: One-step sparse estimates in nonconcave penalized likelihood models
DOI: 10.1007/S10107-017-1114-Y
description: scientific article; zbMATH DE number 6814728