Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality
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_ | 1866912425498902528 |
|---|---|
| author | Diening, Lars Storn, Johannes |
| author_facet | Diening, Lars Storn, Johannes |
| contents | We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality framework extends convergence results for the Kacanov scheme to a broader class of problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_16850 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality Diening, Lars Storn, Johannes Numerical Analysis Optimization and Control 49M29, 35J70, 65N22, 65N30 We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality framework extends convergence results for the Kacanov scheme to a broader class of problems. |
| title | Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality |
| topic | Numerical Analysis Optimization and Control 49M29, 35J70, 65N22, 65N30 |
| url | https://arxiv.org/abs/2501.16850 |