|
This article is cited in 8 scientific papers (total in 8 papers)
Two algorithms for finding the projection of a point onto a nonconvex set in a normed space
V. I. Zabotin, N. K. Arutyunova Kazan State Technical University
Abstract:
Two iteration algorithms are proposed for finding the projection of a point onto a nonconvex set in a normed space, which is given by $f(x) = 0$ equation. For the first case the left hand side of this equation is supposed to satisfy the subordination condition, which generalizes the Lipshitz condition. For the second casethe continuity of $f$ function is supposed and an approximate algorithm of projection is constructed.
Key words:
projection algorithm; algorithm convergence; Lipshitz condition; nonconvex surface.
Received: 14.12.2011 Revised: 06.09.2012
Citation:
V. I. Zabotin, N. K. Arutyunova, “Two algorithms for finding the projection of a point onto a nonconvex set in a normed space”, Zh. Vychisl. Mat. Mat. Fiz., 53:3 (2013), 344–349
Linking options:
https://www.mathnet.ru/eng/zvmmf9882 https://www.mathnet.ru/eng/zvmmf/v53/i3/p344
|
Statistics & downloads: |
Abstract page: | 398 | Full-text PDF : | 82 | References: | 58 | First page: | 21 |
|