Skip to main content

Advertisement

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

Article metrics

  • 813 Accesses

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.

Publisher note

To access the full article, please see PDF.

Author information

Correspondence to Yongfu Su.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Liu, L., Gu, G. & Su, Y. An Iterative Algorithm of Solution for Quadratic Minimization Problem in Hilbert Spaces. J Inequal Appl 2010, 717341 (2010) doi:10.1155/2010/717341

Download citation

Keywords

  • Hilbert Space
  • Minimization Problem
  • Iterative Algorithm
  • Convergence Theorem
  • Nonexpansive Mapping