首页   按字顺浏览 期刊浏览 卷期浏览 Restricted Least Squares Regression and Convex Quadratic Programming
Restricted Least Squares Regression and Convex Quadratic Programming

 

作者: Nathan Mantel,  

 

期刊: Technometrics  (Taylor Available online 1969)
卷期: Volume 11, issue 4  

页码: 763-773

 

ISSN:0040-1706

 

年代: 1969

 

DOI:10.1080/00401706.1969.10490736

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

A parsimonious stepwise procedure for obtaining least squares solutions of multiple regression eqllntions when the regression coefficients are subject to arbitrary but consistent linear restraints is presented. The method is also applicable to the minimization of positive definite quadratic functions. Key to the method is the use of the elements of the appropriate inverse matrix for determining the standardized distance from any unrestricted, or conditionally unrestricted, solution to any boundary or boundary intersection of the permissible region for the regression coefficients.

 

点击下载:  PDF (887KB)



返 回