Generalized reciprocally convex combination lemmas and its application to time-delay systems - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Article Dans Une Revue Automatica Année : 2018

Generalized reciprocally convex combination lemmas and its application to time-delay systems

Alexandre Seuret
Kun Liu
  • Fonction : Auteur
  • PersonId : 763725
  • IdRef : 193541386

Résumé

Various efficient matrix inequalities have recently been proposed to deal with the stability analysis of linear systems with time-varying delays. This paper provides more insights on the relationship between some of them. We present an equivalent formulation of Moon et al.'s inequality, allowing us to discover strong links not only with the most recent and efficient matrix inequalities such as the reciprocally convex combination lemma and also its relaxed version but also with some previous inequalities such as the approximation inequality introduced in [14] or free-matrix-based inequality. More especially, it is proved that these existing inequalities can be captured as particular cases of Moon et al.'s inequality. Examples show the best tradeoff between the reduction of conservatism and the numerical complexity.
Fichier principal
Vignette du fichier
Refined_RCCL_0515_f.pdf (130.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01793309 , version 1 (16-05-2018)

Identifiants

Citer

Alexandre Seuret, Kun Liu, Frédéric Gouaisbaut. Generalized reciprocally convex combination lemmas and its application to time-delay systems. Automatica, 2018, 95, pp.488-493. ⟨10.1016/j.automatica.2018.06.017⟩. ⟨hal-01793309⟩
55 Consultations
58 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More