A stochastic approximation counterpart of the feasible direction method (Q1107247)

A stochastic approximation counterpart of the feasible direction method of Topkis and Veinott is considered. No convexity condition on a function to be minimized is imposed and a procedure for one-dimensional minimization along each feasible direction chosen is included. Stochastic analogues of other feasible direction methods can similarly be developed.