首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the Proximal Point Algorithm
Authors:B Djafari Rouhani  H Khatibzadeh
Institution:(1) Department of Mathematical Sciences, University of Texas at El Paso, El Paso, TX 79968, USA;(2) Department of Mathematics, Tarbiat Modarres University, P.O. Box 14115-175, Tehran, Iran
Abstract:Let A be a maximal monotone operator in a real Hilbert space H and let {u n } be the sequence in H given by the proximal point algorithm, defined by u n =(I+c n A)−1(u n−1f n ), n≥1, with u 0=z, where c n >0 and f n H. We show, among other things, that under suitable conditions, u n converges weakly or strongly to a zero of A if and only if lim inf  n→+∞|w n |<+∞, where w n =(∑ k=1 n c k )−1 k=1 n c k u k . Our results extend previous results by several authors who obtained similar results by assuming A −1(0)≠φ.
Keywords:Proximal-point algorithms  Variational inequalities  Ergodic theorems  Maximal monotone operators  Asymptotic centers
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号