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.