Abstract
K. Nakajo and W. Takahashi in 2003 proved the strong convergence theorems for nonexpansive mappings, nonexpansive semigroups, and proximal point algorithm for zero point of monotone operators in Hilbert spaces by using the hybrid method in mathematical programming. The purpose of this paper is to modify the hybrid iteration method of K. Nakajo and W. Takahashi through the monotone hybrid method, and to prove strong convergence theorems. The convergence rate of iteration process of the monotone hybrid method is faster than that of the iteration process of the hybrid method of K. Nakajo and W. Takahashi. In the proofs in this article, Cauchy sequence method is used to avoid the use of the demiclosedness principle and Opial’s condition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. J. Pinker, A. Seidmann and Y. Vakrat, Managing online auctions: current business and research issues, Management Science, 2003, 49(11): 1457–1484.
M. Harris and A. Raviv, Allocation mechanisms and the design of auctions, Econometrica, 1981, 49: 1477–1499.
R. Myerson, Optimal auction design, Mathematics of Operations Research, 1981, 6: 58–73.
Author information
Authors and Affiliations
Corresponding author
Additional information
*This research is supported by the National Natural Science Foundation of China under Grant No. 10771050.
Rights and permissions
About this article
Cite this article
Su, Y., Qin, X. STRONG CONVERGENCE OF MONOTONE HYBRID METHOD FOR FIXED POINT ITERATION PROCESSES*. J Syst Sci Complex 21, 474–482 (2008). https://doi.org/10.1007/s11424-008-9129-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-008-9129-3