Finding an element in a set by the successive relaxation method (Q1121178)

The author describes two algorithms for finding an element of the set \(D=\{x\in H:\) h(x)\(\leq 0\}\), where H is a Hilbert space and h: \(X\to {\mathbb{R}}\) is a quasiconvex functional, when int \(D\neq \emptyset\). It is shown that such an element is found in a finite number of steps, estimated in the paper.