About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1258983 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Otu Vaarmann / rank | |||
Normal rank |
Revision as of 23:08, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I |
scientific article |
Statements
About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (English)
0 references
11 December 1995
0 references
Let \(H\) be a Hilbert space, \(M\) its nonempty, convex and closed subset representing the solution set of any convex problem and \((x_k)\) a sequence of elements in \(H\) generated by any iterative method. At the outset the author establishes several general statements on the geometrical convergence of the sequence \((x_k)\). Further he investigates more concrete rules of iteration and starts with the iterative scheme \(x_{k+1} = T_k (x_k - s_k)\), where \(s_k\) denotes the shift element \((s_k \in H)\) and the operators \(T_k : H \to H\) are supposed to be Féjer monotone with respect to the solution set \(M\) of the related problem, \(x_0\) arbitrary. He represents a thorough discussion how to improve the corresponding error estimates. Finally, he considers some applications to the approximate solution of convex problems with a solution set \(M\) (e.g. the convex feasibility problem, an optimization problem leading to the projection subgradient method).
0 references
Hilbert space
0 references
convex problem
0 references
iterative method
0 references
geometrical convergence
0 references
error estimates
0 references
convex feasibility problem
0 references
projection subgradient method
0 references