The dual IRLS scheme for (hyper-)graph p-Laplacians and ᵖ regression with large exponents

We introduce an iterative scheme for discrete convex minimization problems of p -Laplace type such as variational graph p -Laplace problems and ᵖ ℓ p regression. In each iteration, the scheme solves only a weighted least-squares problem. We verify linear convergence for suitably regularized problems and derive convergence to any prescribed tolerance even for large exponents p 2 p ≫ 2 .