首页> 外文期刊>Computational Optimization and Applications >A Lyusternik–Graves theorem for the proximal point method
【24h】

A Lyusternik–Graves theorem for the proximal point method

机译:近点法的Lyusternik–Graves定理

获取原文
获取原文并翻译 | 示例
       

摘要

We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y∈T(x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point ([`(x)],0)({bar{x}},0) in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove that they inherit the regularity properties of T, and vice versa. We analyze the cases when the mapping T is metrically regular and strongly regular.
机译:我们考虑求解扰动包含y∈T(x)的广义点算法的广义形式,其中y是接近0的扰动元素,T是从Banach空间X到Banach空间Y的集值映射,其中在其图形中的某个点([`(x)],0)({bar {x}},0)上按度量规则。我们研究了算法生成的收敛迭代的行为,证明了它们继承了T的规则性,反之亦然。我们分析了映射T是度量规则的和强规则的情况。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号