Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms

DOI10.1109/TSP.2015.2436369MaRDI QIDQ4580720zbMATH OpenOpenAlexFDO

Authors Alexandru Onose, B. Dumitrescu

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2015.2436369

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Coordinate descent algorithms for lasso penalized regression
• On greedy randomized coordinate descent methods for solving large linear least-squares problems.
• On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
• Adaptive Lasso for sparse high-dimensional regression models
• ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning
• Coordinate descent algorithm for covariance graphical Lasso
• On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• Sparse total least squares: analysis and greedy algorithms
• Adaptive Lasso in high-dimensional settings

Cited in

(5)

• Coordinate descent algorithms for lasso penalized regression
• An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
• A new self-adaptive CQ algorithm with an application to the LASSO problem
• Coordinate descent algorithm for covariance graphical Lasso
• ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning

This page was built for publication: Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580720)