Abstract and Applied Analysis
Volume 2013 (2013), Article ID 854297, 14 pages
http://dx.doi.org/10.1155/2013/854297
Research Article

Implicit Relaxed and Hybrid Methods with Regularization for Minimization Problems and Asymptotically Strict Pseudocontractive Mappings in the Intermediate Sense

1Department of Mathematics, Shanghai Normal University and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai 200234, China
2Department of Mathematics, Aligarh Muslim University, Aligarh 202 002, India
3Department of Mathematics and Statistics, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia
4Center for Fundamental Science, Kaohsiung Medical University, Kaohsiung 80708, Taiwan

Received 1 February 2013; Accepted 11 March 2013

Academic Editor: Jen-Chih Yao

Copyright © 2013 Lu-Chuan Ceng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We first introduce an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping in the intermediate sense and the set of solutions of the minimization problem (MP) for a convex and continuously Frechet differentiable functional in the setting of Hilbert spaces. The implicit relaxed method with regularization is based on three well-known methods: the extragradient method, viscosity approximation method, and gradient projection algorithm with regularization. We derive a weak convergence theorem for two sequences generated by this method. On the other hand, we also prove a new strong convergence theorem by an implicit hybrid method with regularization for the MP and the mapping . The implicit hybrid method with regularization is based on four well-known methods: the CQ method, extragradient method, viscosity approximation method, and gradient projection algorithm with regularization.