Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Two time-scale stochastic approximation for constrained stochastic optimization and constrained Markov decision problems

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
$31 $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

3 Author(s)
Tadic, Vladislav B. ; Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia ; Doucet, Arnaud ; Sumeetpal Singh

In this paper, constrained stochastic optimization problems are considered for the case where the constraint functions are convex (but the criterion function can be non-convex) and the criterion and constraint functions are available only through their noisy observations. A general algorithm of the two time-scale stochastic approximation type is proposed for these problems. The proposed algorithm is applied to Markov decision problems with average cost, average constraints and parameterized stationary policy. The asymptotic behavior of the proposed algorithm is analyzed for the case where the algorithm step-sizes are constant and the noise in the observations of the criterion and constraint functions depends on the algorithm iterates.

Published in:

American Control Conference, 2003. Proceedings of the 2003  (Volume:6 )

Date of Conference:

4-6 June 2003