By Topic

Stochastic approximation: rate of convergence for constrained problems, and applications to Lagrangian algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Buche ; Div. of Appl. Math., Brown Univ., Providence, RI, USA ; H. J. Kushner

There is a large literature on the rate of convergence problem for general stochastic approximations, for algorithms where the step size either goes to zero or is small and constant. With the exception of the large deviations type, the rate of convergence work is essentially confined to the case where the limit point is not on a constraint boundary. The usual steps are hard to carry out when the limit point is on the boundary of the constraint set. The stability methods which are used to prove tightness of the normalized iterates cannot be carried over in general. We develop the necessary techniques and show that the stationary Gaussian diffusion is replaced by an appropriate stationary reflected linear diffusion. The rate of convergence results immediately imply the advantages of iterate averaging. An application to constrained function minimization under inequality constraints is given where both the objective function and the constraints are observed in the presence of noise

Published in:

Decision and Control, 1999. Proceedings of the 38th IEEE Conference on  (Volume:3 )

Date of Conference: