An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
From MaRDI portal
Publication:962517
DOI10.1155/2010/717341zbMath1189.65126WikidataQ59251696 ScholiaQ59251696MaRDI QIDQ962517
Guanghui Gu, Li Liu, Yongfu Su
Publication date: 7 April 2010
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/230054
fixed points; iterative algorithm; strong convergence; nonexpansive mapping; Hilbert spaces; quadratic minimization problem
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
47J25: Iterative procedures involving nonlinear operators
47H10: Fixed-point theorems
90C48: Programming in abstract spaces
47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.
Cites Work
- An iterative approach to quadratic optimization
- Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Iterative Algorithms for Nonlinear Operators