A theorem on the convergence of algorithms of static stochastic optimization

• Autorzy: J. Koronacki
• Języki publikacji: EN

Abstrakty

EN

The problem of this paper is to minimize a function f, which is scalar-valued and defined on a finite dimensional vector space. An iterative algorithm is of the form X(n+1)=A(n)(X(n)) and can take the usual form X(n+1)=X(n)−a(n)Y(n), where Y(n) can be as in the Kiefer-Wolfowitz procedure, but an is random. Making use of the theorem on convergence of supermartingales the author gives several theorems on the convergence of the procedure to the minimal point of f.

PL

.

Słowa kluczowe

EN

93E10

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1976
• Tom: 4
• Numer: 7

Daty

wydano

1976

online

1976-08-01

Twórcy

autor

J. Koronacki

Identyfikatory

DOI

10.14708/ma.v4i7.1199