@article { ISI:000238044400008,
	title = {A fast algorithm for S-regression estimates},
	journal = {JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS},
	volume = {15},
	number = {2},
	year = {2006},
	month = {JUN},
	pages = {414-427},
	publisher = {AMER STATISTICAL ASSOC},
	type = {Article},
	address = {1429 DUKE ST, ALEXANDRIA, VA 22314 USA},
	abstract = {Equivariant high-breakdown point regression estimates are computationally expensive, and the corresponding algorithms become unfeasible for moderately large number of regressors. One important advance to improve the computational speed of one such estimator is the fast-LTS algorithm. This article proposes an analogous algorithm for computing S-estimates. The new algorithm, that we call {\textquoteleft}{\textquoteleft}fast-S{\textquoteright}{\textquoteright}, is also based on a {\textquoteleft}{\textquoteleft}local improvement{\textquoteright}{\textquoteright} step of the resampling initial candidates. This allows for a substantial reduction of the number of candidates required to obtain a good approximation to the optimal solution. We performed a simulation study which shows that S-estimators computed with the fast-S algorithm compare favorably to the LTS-estimators computed with the fast-LTS algorithm.},
	keywords = {high breakdown point, linear regression, Robustness},
	issn = {1061-8600},
	doi = {10.1198/106186006X113629},
	author = {Salibian-Barrera, M and Yohai, VJ}
}
