A quadratic programming approach for solving the l/sub 1/ multi-block problem

We present a new method to compute solutions to the general multi-block l/sub 1/ control problem. The method is based on solving a standard H/sub 2/ problem and a finite-dimensional semidefinite quadratic programming problem of appropriate dimension. The new method has most of the properties that se...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 35th IEEE Conference on Decision and Control Vol. 4; pp. 4028 - 4033 vol.4
Main Authors Elia, N., Dahlch, M.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1996
Subjects
Control systems
Delay
Dynamic programming
Equations
Finite impulse response filter
Interpolation
Optimal control
Quadratic programming
State-space methods
Upper bound
Online AccessGet full text
ISBN9780780335905
0780335902
ISSN0191-2216
DOI10.1109/CDC.1996.577365

Cover

More Information
Summary:We present a new method to compute solutions to the general multi-block l/sub 1/ control problem. The method is based on solving a standard H/sub 2/ problem and a finite-dimensional semidefinite quadratic programming problem of appropriate dimension. The new method has most of the properties that separately characterize many existing approaches, in particular, as the dimension of the quadratic programming problem increases, this method provides converging upper and lower bounds on the optimal l/sub 1/ norm and, for well posed multi-block problems, ensures the convergence in norm of the suboptimal solutions to an optimal l/sub 1/ solution. The new method does not require the computation of the interpolation conditions, and it allows the direct computation of the suboptimal controller.
ISBN:9780780335905
0780335902
ISSN:0191-2216
DOI:10.1109/CDC.1996.577365