共查询到6条相似文献,搜索用时 0 毫秒
1.
By modifying the direct method to solve the overdetermined linear system we are able to present an algorithm for L1 estimation which appears to be superior computationally to any other known algorithm for the simple linear regression problem. 相似文献
2.
The Barrodale and Roberts algorithm for least absolute value (LAV) regression and the algorithm proposed by Bartels and Conn both have the advantage that they are often able to skip across points at which the conventional simplex-method algorithms for LAV regression would be required to carry out an (expensive) pivot operation. We indicate here that this advantage holds in the Bartels-Conn approach for a wider class of problems: the minimization of piecewise linear functions. We show how LAV regression, restricted LAV regression, general linear programming and least maximum absolute value regression can all be easily expressed as piecewise linear minimization problems. 相似文献
3.
4.
In this paper, the regression model with a nonnegativity constraint on the dependent variable is considered. Under weak conditions, L 1 estimates of the regression coefficients are shown to be consistent. 相似文献
5.
We describe a method for fitting a least absolute residual (LAR) line through a set of two–dimensional points. The algorithm is based on a labeling technique derived from linear programming. It is suited for interactive data analysis and can be carried out with graph paper and a programmable hand calculator. Tests conducted with a Pascal program indicate that the algorithm is computationally efficient. 相似文献
6.
Benoît Cadre 《Statistics》2013,47(4):509-521
Let E be a separable Banach space, which is the dual of a Banach space F. If X is an E-valued random variable, the set of L1-medians of X is ArgminE[(d)]. Assume that this set contains only one element. From any sequence of probability measures {(d) 1} on E, which converges in law to X, we give two approximating sequences of the L1-median, for the weak* topology induced by F. 相似文献