Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)

DOI10.1155/2014/317979zbMath1407.94047OpenAlexW2053023753WikidataQ59065856 ScholiaQ59065856MaRDI QIDQ1718121

Xianqiang Yang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/317979

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Parametric inference under constraints (62F30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• The Adaptive Lasso and Its Oracle Properties
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Least angle regression. (With discussion)
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• Coordinate descent algorithms for lasso penalized regression
• Greed is Good: Algorithmic Results for Sparse Approximation
• Atomic Decomposition by Basis Pursuit
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• A new approach to variable selection in least squares problems
• Compressive Sensing Reconstruction With Prior Information by Iteratively Reweighted Least-Squares
• Online Adaptive Estimation of Sparse Signals: Where RLS Meets the $\ell_1$-Norm

This page was built for publication: Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)