High-dimensional linear regression with hard thresholding regularization: theory and algorithm
type: Item
instance of: scholarly article
title: High-dimensional linear regression with hard thresholding regularization: theory and algorithm
author: Lican Kang
author: Yanyan Liu
author: Yuan Luo
author: Jing Zhang
author: Y. M. Lai
published in: Journal of Industrial and Management Optimization
publication date: 2022-11-14T00:00:00Z
Mathematics Subject Classification ID: 62J05
Mathematics Subject Classification ID: 62H12
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7616046
zbMATH Keywords: generalized Newton method
zbMATH Keywords: hard thresholding regularization
zbMATH Keywords: high-dimensional
zbMATH Keywords: linear regression model
zbMATH Keywords: primal dual active set algorithm
MaRDI profile type: Publication
full work available at URL: jimo.2022034
OpenAlex ID: W4226427382
cites work: Wavelet methods in statistics: some recent developments and their applications
cites work: Heuristics of instability and stabilization in model selection
cites work: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
cites work: A Statistical View of Some Chemometrics Regression Tools
cites work: A unified primal dual active set algorithm for nonconvex sparse recovery
cites work: Q4558147
cites work: Lagrange Multiplier Approach to Variational Problems and Applications
cites work: A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
cites work: Q5405154
cites work: Q3813205
cites work: Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
cites work: Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
cites work: A nonsmooth version of Newton's method
cites work: Bayesian inference for high‐dimensional linear regression under mnet priors
cites work: Q4864293
cites work: Convergence of a block coordinate descent method for nondifferentiable minimization
cites work: Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
cites work: Calibrating nonconvex penalized regression in ultra-high dimension
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: The sparsity and bias of the LASSO selection in high-dimensional linear regression
cites work: A general theory of concave regularization for high-dimensional sparse estimation problems
cites work: Q3174050
cites work: The Adaptive Lasso and Its Oracle Properties
cites work: On the adaptive elastic net with a diverging number of parameters
DOI: 10.3934/JIMO.2022034
description: scientific article; zbMATH DE number 7616046