An Iterative Algorithm of Solution for Quadratic Minimization Problem in Hilbert Spaces
Li Liu, Guanghui Gu, Yongfu Su
Journal of Inequalities and Applications · 2010
doi:10.1155/2010/717341 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.