Multilevel Optimization: Geometric Coarse Models and Convergence Analysis
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916739838640128 |
|---|---|
| author | Vanmaele, Ferdinand Elshiaty, Yara Petra, Stefania |
| author_facet | Vanmaele, Ferdinand Elshiaty, Yara Petra, Stefania |
| contents | We study multilevel techniques, commonly used in PDE multigrid literature, to solve structured optimization problems. For a given hierarchy of levels, we formulate a coarse model that approximates the problem at each level and provides a descent direction for the fine-grid objective using fewer variables. Unlike common algebraic approaches, we assume the objective function and its gradient can be evaluated at each level. Under the assumptions of strong convexity and gradient L-smoothness, we analyze convergence and extend the method to box-constrained optimization. Large-scale numerical experiments on a discrete tomography problem show that the multilevel approach converges rapidly when far from the solution and performs competitively with state-of-the-art methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_11104 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multilevel Optimization: Geometric Coarse Models and Convergence Analysis Vanmaele, Ferdinand Elshiaty, Yara Petra, Stefania Optimization and Control We study multilevel techniques, commonly used in PDE multigrid literature, to solve structured optimization problems. For a given hierarchy of levels, we formulate a coarse model that approximates the problem at each level and provides a descent direction for the fine-grid objective using fewer variables. Unlike common algebraic approaches, we assume the objective function and its gradient can be evaluated at each level. Under the assumptions of strong convexity and gradient L-smoothness, we analyze convergence and extend the method to box-constrained optimization. Large-scale numerical experiments on a discrete tomography problem show that the multilevel approach converges rapidly when far from the solution and performs competitively with state-of-the-art methods. |
| title | Multilevel Optimization: Geometric Coarse Models and Convergence Analysis |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2505.11104 |