The dual IRLS scheme for (hyper-)graph $p$-Laplacians and $\ell^p$ regression with large exponents
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917364224753664 |
|---|---|
| author | Storn, Johannes |
| author_facet | Storn, Johannes |
| contents | We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_26061 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The dual IRLS scheme for (hyper-)graph $p$-Laplacians and $\ell^p$ regression with large exponents Storn, Johannes Optimization and Control 65K10, 49M05, 49M20, 49M29, 68T09, 05C50, 39A12 We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^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. |
| title | The dual IRLS scheme for (hyper-)graph $p$-Laplacians and $\ell^p$ regression with large exponents |
| topic | Optimization and Control 65K10, 49M05, 49M20, 49M29, 68T09, 05C50, 39A12 |
| url | https://arxiv.org/abs/2603.26061 |