A tailored branch-and-bound solver with hyperplane arrangement enhancements solves penalized LTS regression at scales where prior MIO methods fail.
Agull´o J (2001b) New algorithms for computing the least trimmed squares regression estimator.Computational statis- tics & data analysis36(4):425–439
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
A tailored branch-and-bound solver with hyperplane arrangement enhancements solves penalized LTS regression at scales where prior MIO methods fail.