Quadratic programming approach for solving the l1 multi-block problem

Nicola Elia, Munther A. Dahleh

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Scopus citations

Abstract

We present a new method to compute solutions to the general multiblock l1 control problem. The method is based on solving a standard H2 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 l1 norm and, for well posed multiblock problems, ensures the convergence in norm of the suboptimal solutions to an optimal l1 solution. The new method does not require the computation of the interpolation conditions, and it allows the direct computation of the suboptimal controller.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Editors Anon
Pages4028-4033
Number of pages6
StatePublished - Dec 1 1996
Externally publishedYes
EventProceedings of the 35th IEEE Conference on Decision and Control. Part 4 (of 4) - Kobe, Jpn
Duration: Dec 11 1996Dec 13 1996

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume4
ISSN (Print)0191-2216

Other

OtherProceedings of the 35th IEEE Conference on Decision and Control. Part 4 (of 4)
CityKobe, Jpn
Period12/11/9612/13/96

Fingerprint

Dive into the research topics of 'Quadratic programming approach for solving the l<sub>1</sub> multi-block problem'. Together they form a unique fingerprint.

Cite this