Iterative Refinement for ℓp-norm Regression

DOI10.1137/1.9781611975482.86zbMath1434.65025arXiv1901.06764OpenAlexW2912973156MaRDI QIDQ5236270

Sushant Sachdeva, Richard Peng, Rasmus Kyng, Deeksha Adil

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.06764

zbMATH Keywords

linear systemssparse graphsgraph Laplaciansnearly-linear time solvers

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (5)

Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Generalized two-dimensional linear discriminant analysis with regularization ⋮ Optimal Algorithms for Stochastic Complementary Composite Minimization ⋮ Dual Space Preconditioning for Gradient Descent

This page was built for publication: Iterative Refinement for ℓ_p-norm Regression