A fast algorithm for non-negativity model selection
From MaRDI portal
Publication:746289
DOI10.1007/s11222-012-9318-8zbMath1322.62001OpenAlexW1969596620MaRDI QIDQ746289
Cristian Gatu, Erricos John Kontoghiorghes
Publication date: 16 October 2015
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-012-9318-8
Software, source code, etc. for problems pertaining to statistics (62-04) Linear regression; mixed models (62J05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Paired and multiple comparisons; multiple testing (62J15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- All possible subset regressions using the QR decomposition
- Efficient algorithms for computing the best subset regression models for large-scale problems
- A graph approach to generate all possible regression submodels
- Simultaneous estimation in a restricted linear model
- Interior-point methods
- A branch and bound algorithm for constrained least squares
- The Simplex Method for Quadratic Programming
- The polynomial solvability of convex quadratic programming
- Regressions by Leaps and Bounds
- A Branch-and-Bound Solution of a Restricted Least Squares Problem
- A Restricted Least Squares Problem
- Inequality Restrictions in Regression Analysis
- Restricted Least Squares Regression and Convex Quadratic Programming
- An Analysis of a Logical Machine Using Parenthesis-Free Notation
- Parallel algorithms for linear models. Numerical methods and estimation problems
This page was built for publication: A fast algorithm for non-negativity model selection