SIAM Journal on Numerical Analysis, Volume 61, Issue 6, Page 2775-2794, December 2023.
Abstract. We introduce a novel relaxed Kačanov scheme for the computation of the discrete minimizer to the [math]-Laplace problem with [math]. The iterative scheme is easy to implement since each iterate results only from the solve of a weighted, linear Poisson problem. It neither requires an additional line search nor involves unknown constants for the step length. The scheme converges globally, and its rate of convergence is independent of the underlying mesh under certain regularity assumptions on the (discrete) solution.

中文翻译：

---

大指数[数学]-拉普拉斯算子的松弛卡查诺夫方案

《SIAM 数值分析杂志》，第 61 卷，第 6 期，第 2775-2794 页，2023 年 12 月。
摘要。我们引入了一种新颖的宽松 Kačanov 方案，用于计算 [math]-Laplace 问题的离散最小化器。迭代方案很容易实现，因为每次迭代仅产生于加权线性泊松问题的求解。它既不需要额外的线搜索，也不涉及未知的步长常数。该方案全局收敛，并且在（离散）解的某些规律性假设下，其收敛速度与底层网格无关。