Skip to content


From 10am - 4pm GMT on Tuesday 20th June, BMC accounts will be unavailable due to scheduled maintenance. We apologise for any inconvenience caused.
Open Access

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

Journal of Inequalities and Applications20102010:717341

Received: 24 October 2009

Accepted: 28 December 2009

Published: 17 January 2010


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.


Hilbert SpaceMinimization ProblemIterative AlgorithmConvergence TheoremNonexpansive Mapping

Publisher note

To access the full article, please see PDF.

Authors’ Affiliations

Department of Mathematics, Cangzhou Normal University, Hebei, China
Department of Mathematics, Tianjin Polytechnic University, Tianjin, China


© Li Liu et al. 2010

This article is published under license to BioMed Central Ltd. 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.