Improved iteration complexities for overconstrained <i>p</i> -norm regression
Improved iteration complexities for overconstrained <i>p</i> -norm regression
In this paper we obtain improved iteration complexities for solving ℓp regression. We provide methods which given any full-rank A ∈ ℝn × d with n ≥ d, b ∈ ℝn, and p ≥ 2 solve minx ∈ ℝd ||A x − b||p to high precision in time dominated by …