论文信息 - An Algorithm for Restricted Least Squares Regression

An Algorithm for Restricted Least Squares Regression

Abstract A commonly occurring problem in statistics is that of minimizing a least squares expression subject to side constraints. Here a simple iterative algorithm is presented and shown to converge to the desired solution. Several examples are presented, including finding the closest concave (convex) function to a set of points and other general quadratic programming problems. The dual problem to the basic problem is also discussed and a solution for it is given in terms of the algorithm. Finally, extensions to expressions other than least squares are given.

R. Dykstra

[1] C. Hildreth. Point Estimates of Ordinates of Concave Functions , 1954 .

[2] H. D. Brunk. Maximum Likelihood Estimates of Monotone Parameters , 1955 .

[3] Norbert Wiener,et al. On the factorization of matrices , 1955 .

[4] N. Wiener,et al. The prediction theory of multivariate stochastic processes , 1957 .

[5] N. Wiener,et al. The prediction theory of multivariate stochastic processes, II , 1958 .

[6] H. D. Brunk. Conditional Expectation Given A $\sigma$-Lattice and Applications , 1965 .

[7] H. D. Brunk,et al. The Isotonic Regression Problem and its Dual , 1972 .

[8] J. Kalbfleisch. Statistical Inference Under Order Restrictions , 1975 .

[9] D. L. Hanson,et al. Consistency in Concave Regression , 1976 .

[10] Moshe Shaked,et al. Estimation of Starshaped Sequences of Poisson and Normal Means , 1979 .

[11] Tim Robertson,et al. Order Restricted Statistical Tests on Multinomial and Poisson Parameters: The Starshaped Restriction , 1982 .

[12] William A. Porter,et al. Angular factorization of matrices , 1982 .