## Abstract

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

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the IEEE Conference on Decision and Control |

Editors | Anon |

Pages | 4028-4033 |

Number of pages | 6 |

State | Published - Dec 1 1996 |

Externally published | Yes |

Event | Proceedings of the 35th IEEE Conference on Decision and Control. Part 4 (of 4) - Kobe, Jpn Duration: Dec 11 1996 → Dec 13 1996 |

### Publication series

Name | Proceedings of the IEEE Conference on Decision and Control |
---|---|

Volume | 4 |

ISSN (Print) | 0191-2216 |

### Other

Other | Proceedings of the 35th IEEE Conference on Decision and Control. Part 4 (of 4) |
---|---|

City | Kobe, Jpn |

Period | 12/11/96 → 12/13/96 |

## Fingerprint

Dive into the research topics of 'Quadratic programming approach for solving the l_{1}multi-block problem'. Together they form a unique fingerprint.