Abstract
This paper develops an algorithm for estimating the parameters when the parameters are restricted by linear constraints in a general multiple regression model. The algorithm solves discrete approximation in the Φ error where Φ is a convex and symmetric function. These discrete approximations arise in fitting by polynomials, linear regression and goal programming. Discrete approximation problems in the L1 norm is a special case. The approaches to the solution of these approximation problems have a long history. The algorithm utilizes certain properties of the problem to significantly reduce the number of iterations to find the approximated solution. © 1995.
| Original language | English |
|---|---|
| Pages (from-to) | 813-821 |
| Number of pages | 9 |
| Journal | Computers and Industrial Engineering |
| Volume | 28 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jan 1 1995 |
Fingerprint
Dive into the research topics of 'An algorithm for estimating the parameters in multiple linear regression model with linear constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver