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.

Probabilistic cutting plane technique based on maximum volume ellipsoid center

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

2009 / IEEE / 978-1-4244-3871-6

Description

This item was taken from the IEEE Conference ' Probabilistic cutting plane technique based on maximum volume ellipsoid center ' This paper presents a probabilistic cutting plane technique for solving a robust feasibility problem which is to find a solution satisfying a parameter-dependent convex constraint for all possible parameter values. The proposed algorithm employs random samples of the parameter and maximum volume ellipsoid centers of candidates of the solution set. It is shown that the numbers of updates and random samples are polynomials of the problem size. The algorithm is also extended for solving a robust optimization problem.