Halpern型邻近点法的亚稳态率
A rate of metastability for the Halpern type Proximal Point Algorithm
摘要:
使用证明理论技术,我们分析了H. K. Xu关于Halpern型邻近点法强收敛的结果。我们得到了一个亚稳率(在T. Tao),并给出了迭代的渐近正则性.此外,我们最终的定量结果绕过了需要的顺序弱紧的论点,目前在原来的证明。这种消除反映在原始递归定量信息的提取中。这项工作是根据最近的结果证明挖掘关于删除顺序弱紧参数。
英文摘要:
Using proof-theoretical techniques, we analyze a proof by H.-K. Xu regarding a result of strong convergence for the Halpern type proximal point algorithm. We obtain a rate of metastability (in the sense of T. Tao) and also a rate of asymptotic regularity for the iteration. Furthermore, our final quantitative result bypasses the need of the sequential weak compactness argument present in the original proof. This elimination is reflected in the extraction of primitive recursive quantitative information. This work follows from recent results in Proof Mining regarding the removal of sequential weak compactness arguments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。