RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2013 Volume 53, Number 3, Pages 344–349 (Mi zvmmf9882)

This article is cited 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.

UDC: 519.658

MSC: 65D15

Received: 14.12.2011
Revised: 06.09.2012

DOI: 10.7868/S0044466913030162



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026