Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1121.65071
Yao, Yonghong; Liou, Yeong-Cheng; Yao, Jen-Chih
An iterative algorithm for approximating convex minimization problem. (English)
[J] Appl. Math. Comput. 188, No. 1, 648-656 (2007). ISSN 0096-3003

The authors propose a new algorithm for the convex minimization problem, without assuming any type of commutativity properties on an infinite family of nonexpansive mappings. The first two sections present an overview of the problem and its applications as well as some useful background information and relevant known theorems. In the third and last section, the main result of this short article is presented, in the form of a theorem that relates to the strong convergence of the proposed algorithm, which is the unique minimizer of the quadratic function over the set of fixed points.
[Efstratios Rappos (London)]

MSC 2000:: *65K05 Mathematical programming (numerical methods)
90C25 Convex programming

Keywords: nonexpansive mapping; convex minimization problem; iterative algorithm; convergence

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]