By Topic

Markov Chain Monte Carlo method exploiting barrier functions with applications to control and optimization

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)
B. T. Polyak ; Institute for Control Sciences RAS, Moscow, Russia ; E. N. Gryazina

In previous works the authors proposed to use Hit-and-Run (H&R) versions of Markov Chain Monte Carlo (MCMC) algorithms for various problems of control and optimization. However the results are unsatisfactory for “bad“ sets, such as level sets of ill-posed functions. The idea of the present paper is to exploit the technique developed for interior-point methods of convex optimization, and to combine it with MCMC algorithms. We present a new modification of H&R method exploiting barrier functions and its validation. Such approach is well tailored for sets defined by linear matrix inequalities (LMI), which are widely used in control and optimization. The results of numerical simulation are promising.

Published in:

2010 IEEE International Symposium on Computer-Aided Control System Design

Date of Conference:

8-10 Sept. 2010