By Topic

A Hierarchy of Near-Optimal Policies for Multistage Adaptive 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
$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)
Bertsimas, D. ; Sloan Sch. of Manage. & the Oper. Res. Center, Massachusetts Inst. of Technol., Cambridge, MA, USA ; Iancu, D.A. ; Parrilo, P.A.

In this paper, we propose a new tractable framework for dealing with linear dynamical systems affected by uncertainty, applicable to multistage robust optimization and stochastic programming. We introduce a hierarchy of near-optimal polynomial disturbance-feedback control policies, and show how these can be computed by solving a single semidefinite programming problem. The approach yields a hierarchy parameterized by a single variable (the degree of the polynomial policies), which controls the trade-off between the optimality gap and the computational requirements. We evaluate our framework in the context of three classical applications-two in inventory management, and one in robust regulation of an active suspension system-in which very strong numerical performance is exhibited, at relatively modest computational expense.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 12 )