A convex parameterization for solving constrained min-max problems with a quadratic cost.
Kerrigan E. C. and Alamo T.
November 2003 Technical Report: CUED/F-INFENG/TR.470
Abstract
This paper is concerned with the application and analysis of a recent result in the literature on robust optimization to the control of linear discrete-time systems, which are subject to unknown state disturbances and mixed constraints on the state and input. By parameterizing the control input sequence as an affine function of the disturbance sequence, it is shown that a certain class of finite horizon min-max control problems is convex and that the number of variables and constraints grows polynomially with the problem size. It is assumed that the constraint and the disturbance sets are polyhedral and that the cost is a suitably-chosen quadratic, in which the disturbance is negatively weighted as in H-infinity control.
Pre-Prints
[PDF]
BibTex Entry
- @TechReport{kerrigan:alamo:2003,
- author = {Kerrigan E. C. and Alamo T.},
- institution = {Department of Engineering, University of Cambridge},
- title = {A convex parameterization for solving constrained min-max problems with a quadratic cost.},
- year = {2003},
- address = {Cambridge, UK},
- bibkey = {kerrigan:alamo:2003},
- month = {November},
- note = {CUED/F-INFENG/TR.470}
- }
|