An algorithm for ^ regression with quadratic complexity

DOI10.1023/A:1017916132749zbMATH Open1011.62073OpenAlexW145880085MaRDI QIDQ1599286FDOQ1599286

Authors: R. Smith 

Publication date: 9 June 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017916132749

Recommendations

• An efficient method for \(l^\infty\) regression
• Algorithms and complexity for least median of squares regression
• Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models
• Computing Least Median of Squares Regression Lines and Guided Topological Sweep
• The determination of a ``least quantile of squares regression line for all quantiles

zbMATH Keywords

polynomial algorithmquadratic complexity

Mathematics Subject Classification ID

Linear regression; mixed models (62J05)

Cites Work

• Quicksort
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense

Cited In (4)

• An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions
• Title not available (Why is that?)
• Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models
• An efficient method for \(l^\infty\) regression

Uses Software

• Quicksort

This page was built for publication: An algorithm for \(\ell^\infty\) regression with quadratic complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599286)