An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
DOI10.1155/2010/717341zbMath1189.65126OpenAlexW1979359694WikidataQ59251696 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 pointsiterative algorithmstrong convergencenonexpansive mappingHilbert spacesquadratic minimization problem
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Programming in abstract spaces (90C48) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
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
This page was built for publication: An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
