ABOUT CONVERGENCE OF SCALABLE ALGORITHM OF CONSTRUCTION PSEUDOPROJECTION ON CONVEX CLOSED SET

The convergence theorem for the algorithm of construction pseudoprojection on convex closed set is proved. This algorithm is main part of the iterative method for solving strong separability problem, also it let effective paralleling for a lot of processors.

Keywords

Fejer's mapping, problem of strong separating, iterative method, pseudoprojection of point.

References

1. Eremin I.I., Mazurov V.D. Nestatsionarnye protsessy matematicheskogo programmirovaniya [Nonstationary processes of mathematical programming]. Moscow, Nauka, 1979. 288 p.
2. Eremin I.I. Feyerovskie metody sil'noy otdelimosti vypuklykh poliedral'nykh mnozhestv [Fejer methods for the strong separability of convex polyhedral sets]. Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 12, pp. 33 - 43.
3. Eremin I.I. Teoriya lineynoy optimizatsii [Theory of linear optimization]. Ekaterinburg, 'Ekaterinburg', 1999. 312 p.
4. Ershova A.V. Algoritm razdeleniya dvukh vypuklykh neperesekayushchikhsya mnogogrannikov s ispolzovaniem feyerovskikh otobrazheniy [The algorithm of separation of two convex not intersect polyhedral using Fejer's mappings]. Sistemy upravleniya i informatsionnye tekhnologii [Controlling system and information technology], 2009, № 1(35), pp. 53 - 56.