An iterative algorithm for approximating convex minimization problem (Q2371476)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5169767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative algorithm for approximating convex minimization problem |
scientific article; zbMATH DE number 5169767 |
Statements
An iterative algorithm for approximating convex minimization problem (English)
0 references
4 July 2007
0 references
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.
0 references
nonexpansive mapping
0 references
convex minimization problem
0 references
iterative algorithm
0 references
convergence
0 references
0 references
0 references
0.9644874
0 references
0.9631287
0 references
0.9439446
0 references
0.9422718
0 references
0.94193715
0 references
0.94113404
0 references
0.9334117
0 references
0.93203694
0 references
