Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality
Diening L, Storn J (2025)
arXiv:2501.16850.
Preprint | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Einrichtung
Abstract / Bemerkung
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.
Erscheinungsjahr
2025
Zeitschriftentitel
arXiv:2501.16850
Page URI
https://pub.uni-bielefeld.de/record/3000415
Zitieren
Diening L, Storn J. Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality. arXiv:2501.16850. 2025.
Diening, L., & Storn, J. (2025). Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality. arXiv:2501.16850. https://doi.org/10.48550/ARXIV.2501.16850
Diening, Lars, and Storn, Johannes. 2025. “Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality”. arXiv:2501.16850.
Diening, L., and Storn, J. (2025). Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality. arXiv:2501.16850.
Diening, L., & Storn, J., 2025. Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality. arXiv:2501.16850.
L. Diening and J. Storn, “Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality”, arXiv:2501.16850, 2025.
Diening, L., Storn, J.: Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality. arXiv:2501.16850. (2025).
Diening, Lars, and Storn, Johannes. “Guaranteed upper bounds for iteration errors and modified Kacanov schemes via discrete duality”. arXiv:2501.16850 (2025).
arXiv: 
Google Scholar