All possible subset regressions using the QR decomposition
From MaRDI portal
Publication:804185
Cites work
- scientific article; zbMATH DE number 3684784 (Why is no real title available?)
- scientific article; zbMATH DE number 3725656 (Why is no real title available?)
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- scientific article; zbMATH DE number 3551729 (Why is no real title available?)
- scientific article; zbMATH DE number 3997027 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3254517 (Why is no real title available?)
- A Tutorial on the SWEEP Operator
- Algorithm AS 164: Least Squares Subject to Linear Constraints
- Regressions by Leaps and Bounds
- Selection of Subsets of Regression Variables
Cited in
(6)- All possible subset regressions using the triangular decomposition
- A fast algorithm for non-negativity model selection
- Efficient algorithms for computing the best subset regression models for large-scale problems
- Applied regression analysis bibliography update 1988-89
- A graph approach to generate all possible regression submodels
- Complete subset regressions
This page was built for publication: All possible subset regressions using the QR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804185)