Abstract:
We consider (uniform, $M$-Fejér, etc.) contraction mappings with the aim of constructing iterative methods for systems of linear and convex inequalities, problems of linear and convex programming, matrix games, and approximation optimization problems.
Keywords:linear and convex programming, contraction mappings, Fejér processes, fixed point set, projection operator.
Fulltext:
PDF file (171 kB)