No label defined (Q3727261)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3958587
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3958587

      Statements

      0 references
      1984
      0 references
      numerical approximation of convex set
      0 references
      convergence
      0 references
      real Hilbert space
      0 references
      generalized descent method
      0 references
      Fejer approximations
      0 references
      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.
      0 references

      Identifiers