Algorithms and complexity for least median of squares regression
From MaRDI portal
Publication:1072298
DOI10.1016/0166-218X(86)90009-0zbMath0587.62078OpenAlexW2060909287MaRDI QIDQ1072298
William Steiger, J. Michael Steele
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(86)90009-0
algorithmsrobustnesstime complexitybreakdown pointpiecewise linearleast median of squares regression linequadratic number of local minima
Analysis of algorithms and problem complexity (68Q25) Robustness and adaptive procedures (parametric inference) (62F35) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Robust estimation of the parameters of \(g\)-\textit{and}-\(h\) distributions, with applications to outlier detection ⋮ Asymmetric \(\nu\)-tube support vector regression ⋮ Formulas for the Exact LMS and LQS Estimators ⋮ An entropy-like estimator for robust parameter identification ⋮ The determination of a ``least quantile of squares regression line for all quantiles ⋮ SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression ⋮ Parallel algorithms for least median of squares regression ⋮ Least quantile regression via modern optimization ⋮ On the implementation of LIR: the case of simple linear regression with interval data ⋮ The feasible set algorithm for least median of squares regression ⋮ An Exact Algorithm for Likelihood-Based Imprecise Regression in the Case of Simple Linear Regression with Interval Data ⋮ BACON: blocked adaptive computationally efficient outlier nominators. ⋮ Efficient sorting during repetitive statistical computations: Algorithms and an application
Cites Work
This page was built for publication: Algorithms and complexity for least median of squares regression
