Open Access
2015 THE PROX-TIKHONOV-LIKE FORWARD-BACKWARD METHOD AND APPLICATIONS
D. R. Sahu, Q. H. Ansari, J. C. Yao
Taiwanese J. Math. 19(2): 481-503 (2015). DOI: 10.11650/tjm.19.2015.4972

Abstract

It is known, by Rockafellar [SIAM J. Control Optim., 14 (1976), 877-898], that the proximal point algorithm (PPA) converges weakly to a zero of a maximal monotone operator in a Hilbert space, but it fails to converge strongly. Lehdili and Moudafi [Optimization, 37(1996), 239-252] introduced the new prox-Tikhonov regularization method for PPA to generate a strongly convergent sequence and established a convergence property for it by using the technique of variational distance in the same space setting. In this paper, the prox-Tikhonov regularization method for the proximal point algorithm of finding a zero for an accretive operator in the framework of Banach space is proposed. Conditions which guarantee the strong convergence of this algorithm to a particular element of the solution set is provided. An inexact variant of this method with non-summable error sequence is also discussed.

Citation

Download Citation

D. R. Sahu. Q. H. Ansari. J. C. Yao. "THE PROX-TIKHONOV-LIKE FORWARD-BACKWARD METHOD AND APPLICATIONS." Taiwanese J. Math. 19 (2) 481 - 503, 2015. https://doi.org/10.11650/tjm.19.2015.4972

Information

Published: 2015
First available in Project Euclid: 4 July 2017

zbMATH: 1357.47077
MathSciNet: MR3332309
Digital Object Identifier: 10.11650/tjm.19.2015.4972

Subjects:
Primary: 47J20 , 49J40 , 65J15

Keywords: accretive operator , maximal monotone operator , metric projection mapping , proximal point algorithm , Regularization method , resolvent identity , strong convergence , uniformly Gâteaux differentiable norm

Rights: Copyright © 2015 The Mathematical Society of the Republic of China

Vol.19 • No. 2 • 2015
Back to Top