Best subset solution path for linear dimension reduction models using continuous optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1175931 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- scientific article; zbMATH DE number 2201408 (Why is no real title available?)
- scientific article; zbMATH DE number 3340880 (Why is no real title available?)
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- A sparse PLS for variable selection when integrating omics data
- Bayesian variable selection regression of multivariate responses for group data
- Best subset selection via a modern optimization lens
- Best subset selection via cross-validation criterion
- Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- COMBSS: best subset selection via continuous optimization
- Discussion of ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Generalized power method for sparse principal component analysis
- On model selection curves
- PLS for Big Data: a unified parallel algorithm for regularised group PLS
- Partial least squares for functional joint models with applications to the Alzheimer's disease neuroimaging initiative study
- Sparse partial least squares regression for simultaneous dimension reduction and variable selection
- Sparse partial least squares classification for high dimensional data
- Sparse partial least squares with group and subgroup structure
- Sparse principal component analysis via regularized low rank matrix approximation
- Statistical and computational trade-offs in estimation of sparse principal components
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
This page was built for publication: Best subset solution path for linear dimension reduction models using continuous optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7004694)
