首页> 外文期刊>Journal of Global Optimization >Pseudomonotone operators and the Bregman Proximal Point Algorithm
【24h】

Pseudomonotone operators and the Bregman Proximal Point Algorithm

机译:伪单调算子和Bregman近点算法

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

摘要

To permit the stable solution of ill-posed problems, the Proximal Point Algorithm (PPA) was introduced by Martinet (RIRO 4:154-159, 1970) and further developed by Rockafellar (SIAM J Control Optim 14:877-898,1976). Later on, the usual proximal distance function was replaced by the more general class of Bregman(-like) functions and related distances; see e.g. Chen and Teboulle (SIAM J Optim 3:538-543, 1993), Eckstein (Math Program 83:113-123, 1998), Kaplan and Tichatschke (Optimization 56(1-2):253-265, 2007), and Solodov and Svaiter (Math Oper Res 25:214-230, 2000). An adequate use of such generalized non-quadratic distance kernels admits to obtain an interior-point-effect, that is, the auxiliary problems may be treated as unconstrained ones. In the above mentioned works and nearly all other works related with this topic it was assumed that the operator of the considered variational inequality is a maximal monotone and paramonotone operator. The approaches of El-Farouq (JOTA 109:311-326,2001), and Schaible et al. (Taiwan J Math 10(2):497-513, 2006) only need pseudomonotonicity (in the sense of Karamardian in JOTA 18:445-454, 1976); however, they make use of other restrictive assumptions which on the one hand contradict the desired interior-point-effect and on the other hand imply uniqueness of the solution of the problem. The present work points to the discussion of the Bregman algorithm under significantly weaker assumptions, namely pseudomonotonicity [and an additional assumption much less restrictive than the ones used by El-Farouq and Schaible et al. We will be able to show that convergence results known from the monotone case still hold true; some of them will be sharpened or are even new. An interior-point-effect is obtained, and for the generated subproblems we allow inexact solutions by means of a unified use of a summable-error-criterion and an error criterion of fixed-relative-error-type (this combination is also new in the literature).
机译:为了稳定解决不适定问题,Martinet(RIRO 4:154-159,1970)引入了近点算法(PPA),Rockafellar(SIAM J Control Optim 14:877-898,1976)进一步开发了该算法。 。后来,通常的近端距离函数被更通用的Bregman(-like)函数和相关距离取代了;参见例如Chen和Teboulle(SIAM J Optim 3:538-543,1993),Eckstein(数学计划83:113-123,1998),Kaplan和Tichatschke(Optimization 56(1-2):253-265,2007)和Solodov和Svaiter(Math Oper Res 25:214-230,2000)。充分利用这样的广义非二次距离核可以获得内点效应,也就是说,可以将辅助问题视为不受约束的问题。在上面提到的著作以及几乎所有与该主题相关的著作中,都假设所考虑的变分不等式的算子是最大单调和对单调算子。 El-Farouq(JOTA 109:311-326,2001)和Schaible等人的方法。 (Taiwan J Math 10(2):497-513,2006)仅需要伪单调性(就JOTA 18:445-454,1976中的Karamardian而言);然而,它们利用了其他限制性假设,这些限制性假设一方面与期望的内点效应相矛盾,另一方面暗示了问题解决方案的唯一性。目前的工作指向了在极弱的假设(即伪单调性)和比El-Farouq和Schaible等人使用的假设少得多的限制的情况下对Bregman算法的讨论。我们将能够证明单调情况下已知的收敛结果仍然成立。其中一些将被锐化甚至是新的。获得内点效应,并且对于所生成的子问题,我们通过统一使用可加误差准则和固定相对误差类型的误差准则来允许不精确解(此组合在文献)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号