Two algorithms for finding the projection of a point onto a nonconvex set in a normed space
Two iteration algorithms are proposed for finding the projection of a point onto a nonconvex set in a normed space, which is given by an equation \(f(x) = 0\). 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 case, the continuity of the function \(f\) is supposed and an approximate algorithm of projection is constructed.
scientific article; zbMATH DE number 6188982