Efficient path algorithms for clustered Lasso and OSCAR

DOI10.1007/S42081-024-00269-8MaRDI QIDQ6670096zbMATH OpenFDO

Authors Atsumori Takahashi, Shunichi Nomura

Publication date 22 January 2025

Published in Japanese Journal of Statistics and Data Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S42081-024-00269-8

zbMATH Keywords

clustered Lassofeature clusteringoctagonal shrinkage and clustering algorithm for regression (OSCAR)solution path algorithm

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Algorithms for Fitting the Constrained Lasso
• Efficient sparse semismooth Newton methods for the clustered Lasso problem
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 6253954 (Why is no real title available?)
• Pathwise coordinate optimization
• Regularization and Variable Selection Via the Elastic Net
• Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
• SLOPE-adaptive variable selection via convex optimization
• Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
• Sparse regression with exact clustering
• Sparse regression with multi-type regularized feature modeling
• Sparsity and Smoothness Via the Fused Lasso
• The dual and degrees of freedom of linearly constrained generalized Lasso
• The solution path of the generalized lasso

This page was built for publication: Efficient path algorithms for clustered Lasso and OSCAR

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