1979
DOI: 10.1080/03610917908812113
|View full text |Cite
|
Sign up to set email alerts
|

A revised simplex algorithm for the absolute deviation curve fitting problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
51
0

Year Published

1980
1980
2014
2014

Publication Types

Select...
7
3

Relationship

1
9

Authors

Journals

citations
Cited by 114 publications
(53 citation statements)
references
References 11 publications
0
51
0
Order By: Relevance
“…In general, LAV regression requires three ,Bs represent the log of the SIs for the special computational resources to calculate three concentrations of BeSO4 on harvest parameter estimates (8). In this situation, day 5 and the next three Ps are the corre-however, it is only necessary to find the sponding estimates on day 7.…”
Section: Rerssion Model For the Belpt Datamentioning
confidence: 99%
“…In general, LAV regression requires three ,Bs represent the log of the SIs for the special computational resources to calculate three concentrations of BeSO4 on harvest parameter estimates (8). In this situation, day 5 and the next three Ps are the corre-however, it is only necessary to find the sponding estimates on day 7.…”
Section: Rerssion Model For the Belpt Datamentioning
confidence: 99%
“…Adapting the estimation strategies of Armstrong, Frome and Kung (1979), Barrodale and Roberts (1973), Buchinsky (1994), Chamberlain (1994), and Wagner (1959) the problem of minimization of the sum of absolute deviations of sample wages from an arbitrarily chosen quantile wage can, in the simplest case, be expressed as: The standard errors of the estimated quantile regression coefficients are typically computed by the method of Koenker and Bassett (1982). These standard errors, however, are downward biased because they do not take into account the heteroscedasticity of the disturbance terms.…”
Section: Appendix: Quantile Wage Regression and Bootstrap Standard Ermentioning
confidence: 99%
“…12 In this study, the minimisation problem is solved by the linear programming techniques suggested by Amstrong et al, (1979). 13 Although the literature is not definite as to the dbestT path to follow, this does not pose a serious problem.…”
mentioning
confidence: 99%