Global optimization of H Problems: Application to robust control synthesis under structural constraints

Dominique Monnet, Jordan Ninin, Benoit Clement

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

In this paper, a new technique to compute a synthesis structured Robust Control Law is developed. This technique is based on global optimization methods using a Branch-and-Bound algorithm. The original problem is reformulated as a min/max problem with non-convex constraint. Our approach uses interval arithmetic to compute bounds and accelerate the convergence.

Original languageEnglish
Title of host publicationMathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Revised Selected Papers
EditorsIlias S. Kotsireas, Siegfried M. Rump, Chee K. Yap
Place of PublicationSwitzerland
PublisherSpringer-Verlag
Pages550-554
Number of pages5
ISBN (Electronic)9783319328591
ISBN (Print)9783319328584
DOIs
Publication statusPublished - 2016
Externally publishedYes
Event6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 - Berlin, Germany
Duration: 11 Nov 201513 Nov 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9582
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015
Country/TerritoryGermany
CityBerlin
Period11/11/1513/11/15

Keywords

  • Robust Control
  • Global optimization
  • Branch and bound
  • non-convex constraint
  • convergence

Fingerprint

Dive into the research topics of 'Global optimization of H Problems: Application to robust control synthesis under structural constraints'. Together they form a unique fingerprint.

Cite this