Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality
Numerical Analysis
2025-06-13 v2 Numerical Analysis
Optimization and Control
Abstract
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.
Cite
@article{arxiv.2501.16850,
title = {Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality},
author = {Lars Diening and Johannes Storn},
journal= {arXiv preprint arXiv:2501.16850},
year = {2025}
}