Strong and Weak Convergence of Modified Mann Iteration for New Resolvents of Maximal Monotone Operators in Banach Spaces

Plubtieng, Somyot; Sriprad, Wanna
January 2009
Abstract & Applied Analysis;2009, Special section p1
Academic Journal
We prove strong and weak convergence theorems for a new resolvent of maximal monotone operators in a Banach space and give an estimate of the convergence rate of the algorithm. Finally, we apply our convergence theorem to the convex minimization problem. The result present in this paper extend and improve the corresponding result of Ibaraki and Takahashi (2007), and Kim and Xu (2005).


Related Articles

  • Composite iterative schemes for maximal monotone operators in reflexive Banach spaces. Cholamjiak, Prasit; Cho, Yeol; Suantai, Suthep // Fixed Point Theory & Applications;Dec2011, Vol. 2011 Issue 1, p1 

    In this article, we introduce composite iterative schemes for finding a zero point of a finite family of maximal monotone operators in a reflexive Banach space. Then, we prove strong convergence theorems by using a shrinking projection method. Moreover, we also apply our results to a system of...

  • Hybrid Projection Algorithm for Two Countable Families of Hemirelatively Nonexpansive Mappings and Applications. Zi-Ming Wang; Kumam, Poom // Journal of Applied Mathematics;2013, p1 

    Two countable families of hemirelatively nonexpansive mappings are considered based on a hybrid projection algorithm. Strong convergence theorems of iterative sequences are obtained in an uniformly convex and uniformly smooth Banach space. As applications, convex feasibility problems,...

  • Accuracy Certificates for Computational Problems with Convex Structure. Nemirovski, Arkadi; Onn, Shmuel; Rothblum, Uriel G. // Mathematics of Operations Research;Feb2010, Vol. 35 Issue 1, p52 

    The goal of this paper is to introduce the notion of certificates, which verify the accuracy of solutions of computational problems with convex structure. Such problems include minimizing convex functions, variational inequalities with monotone operators, computing saddle points of...

  • Strong and Weak Convergence Theorems for Common Solutions of Generalized Equilibrium Problems and Zeros of Maximal Monotone Operators. Zeng, L.-C.; Ansari, Q. H.; Shyu, David S.; Yao, J.-C. // Fixed Point Theory & Applications;2010, Special section p1 

    No abstract available.

  • Iterative Schemes for Generalized Equilibrium Problem and Two Maximal Monotone Operators. Zeng, L. C.; Lin, Y. C.; Yao, J. C. // Journal of Inequalities & Applications;2009, Vol. 2009, Special section p1 

    The purpose of this paper is to introduce and study two new hybrid proximal-point algorithms for finding a common element of the set of solutions to a generalized equilibrium problem and the sets of zeros of two maximal monotone operators in a uniformly smooth and uniformly convex Banach space....

  • Bregman Distance and Strong Convergence of Proximal-Type Algorithms. Li-Wei Kuo; Sahu, D. R. // Abstract & Applied Analysis;2013, p1 

    The purpose of this paper is to discuss some fundamental properties of Bregman distance, generalized projection operators, firmly nonexpansive mappings, and resolvent operators of set-valued monotone operators corresponding to a functional Φ(|| · ||). We further study some proximal point...

  • Iterative Approaches to Find Zeros of Maximal Monotone Operators by Hybrid Approximate Proximal Point Methods. Lu Chuan Ceng; Yeong Cheng Liou; Naraghirad, Eskandar // Fixed Point Theory & Applications;2011, Special section p1 

    The purpose of this paper is to introduce and investigate two kinds of iterative algorithms for the problem of finding zeros of maximal monotone operators. Weak and strong convergence theorems are established in a real Hilbert space. As applications, we consider a problem of finding a minimizer...

  • CORES OF TANGENT CONES AND CLARKE'S TANGENT CONE. Martin, D. H.; Watkins, G. G. // Mathematics of Operations Research;Nov85, Vol. 10 Issue 4, p565 

    It is known that Clarke's tangent cone at any point of any subset of R[sup n] is always both unique and convex. By contrast, nearly all other notions of convex tangent cone in the literature are monotone in the sense that if a convex cone K is a tangent cone at n point x[sup 0] of a set C...

  • A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization. Hu, Ping; Liu, Xu-Qing // Journal of Optimization Theory & Applications;Sep2013, Vol. 158 Issue 3, p773 

    This paper mainly aims to study a new nonmonotone line search slackness technique for unconstrained optimization problems and show that it possesses the global convergence without needing condition of convexity. We establish the corresponding algorithm and illustrate its effectiveness by virtue...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics