scientific article; zbMATH DE number 3958587
Let \(\Omega_ 0=\Omega \cap Q\) be a convex set in a real Hilbert space E, \(Q\subset E\) convex and closed and \(\Omega\) \(\subset E\) convex with the kernel \({}^ 0\Omega \neq \emptyset\) and \({}^ 0\Omega \cap Q\neq \emptyset\). The generalized descent method for finding a point of \(\Omega_ 0\) is developed in the form \[ (1)\quad x_{k+1}=\pi_ Q(\phi (x_{k+1})),\quad x_ k\subset E,\quad k=0,1,... \] \((x_ 0\in E\) is chosen arbitrarily) where \(\phi\) : \(E\to \in\) and \(\pi_ Q(y)\) denotes the projection of \(y\in Q\subset E\) on \(\Omega\). The author proves that the method (1) converges in a finite number of steps which does not change if the steps of (1) are combined with Fejer approximations.
- Generalized descent method for minimization of functionals
- A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space
- Method of orthogonal descent
- Iterative solution of convex problems by fejer-monotone methods
- The combination projection method for solving convex feasibility problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727261)