Indexed metadata
Guaranteed Upper Bounds for Iteration Errors and Modified Kačanov Schemes via Discrete Duality
Lars Diening, Johannes Storn
Source record
Source: Crossref
Published: Jun 17, 2025
DOI: 10.1515/cmam-2025-0017
Open original source ↗Source abstract
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 Kačanov scheme to a broader class of problems.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.