Journal of Inequalities and Applications
Volume 2010 (2010), Article ID 717341, 6 pages
doi:10.1155/2010/717341
Research Article

An Iterative Algorithm of Solution for Quadratic Minimization Problem in Hilbert Spaces

1Department of Mathematics, Cangzhou Normal University, Hebei, Cangzhou 061001, China
2Department of Mathematics, Tianjin Polytechnic University, Tianjin 300160, China

Received 24 October 2009; Accepted 28 December 2009

Academic Editor: Jong Kim

Copyright © 2010 Li Liu 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

The purpose of this paper is to introduce an iterative algorithm for finding a solution of quadratic minimization problem in the set of fixed points of a nonexpansive mapping and to prove a strong convergence theorem of the solution for quadratic minimization problem. The result of this article improved and extended the result of G. Marino and H. K. Xu and some others.