No label defined (Q3701202)
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 3926637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3926637 |
Statements
1986
0 references
stationary point
0 references
method of feasible directions
0 references
non-smooth and nonconvex objective function
0 references
stochastic subgradients
0 references
stochastic approximation
0 references
convergence
0 references
Lyapunov function
0 references
0.8459059596061707
0 references
0.8132381439208984
0 references
0.7987672090530396
0 references
0.7905076146125793
0 references
[For the entire collection see Zbl 0572.00022.] A method of feasible directions is presented for solving stochastic programming problems with a possibly non-smooth and nonconvex objective function. The algorithm uses stochastic subgradients which, by an auxiliary filter, are averaged and used in direction finding subproblems. The obtained feasible directions are then applied in the main (stochastic approximation type) iteration. The convergence of the procedure (with probability 1) is proved by means of a Lyapunov function technique.
0 references