Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Sequential randomized algorithms for robust optimization

By: Wada, T.; Fujisaki, Y.;

2007 / IEEE / 978-1-4244-1497-0


This item was taken from the IEEE Conference ' Sequential randomized algorithms for robust optimization ' A probabilistic approach is considered for robust optimization, where a convex objective function is minimized subject to a parameter dependent convex constraint. A novel sequential randomized algorithm is proposed for solving this optimization employing the stochastic ellipsoid method. It is shown that the upper bounds of the numbers of random samples and updates of the algorithm are much less than those of the stochastic bisection method utilizing the stochastic ellipsoid method at each iteration. This feature actually leads to a computational advantage, which is demonstrated through a numerical example.