Continuous Optimization Reading Seminar - Nargiz Kalantarova

Title: Robust Convex Optimization 

Abstract:

We continue our study of convex optimization problems with uncertain data by discussing the paper by Ben-Tal and Nemirovski, 'Robust Convex Optimization'. We show that if the uncertain data belongs to an ellipsoidal uncertainty set then for some of the most generic convex optimization problems the corresponding robust convex program is exactly a tractable problem which can be solved by efficient algorithms.