A cutting plane algorithm for frequency domain specification with application to bending modes attenuation

Mohamed Abbas-Turki, Gilles Duc, Stephane Font, Benoît Clement

Research output: Contribution to conferencePaperpeer-review

2 Citations (Scopus)

Abstract

Bending modes attenuation is a very challenging problem, especially if the modes are close to the bandwidth, in which case applying weighting filters is useless. This work aims to present an idea based on the Cutting Plane Algorithm (CPA) to overcome such problems. The interesting point of using CPA instead of optimization under LMI (Linear Matrix Inequality) constraints is that no additional variables are introduced, which has a significant effect on the computation time. The application of Youla parameterization is considered in order to restore the linearity in the compensator parameters, thus the convexity is guaranteed and the CPA is efficiently used.

Original languageEnglish
Pages4748-4752
Number of pages5
DOIs
Publication statusPublished - Aug 2005
Externally publishedYes
Event2005 American Control Conference, ACC - Portland, OR, United States
Duration: 8 Jun 200510 Jun 2005

Conference

Conference2005 American Control Conference, ACC
Country/TerritoryUnited States
CityPortland, OR
Period8/06/0510/06/05

Keywords

  • Cutting Plane Algorithm
  • KYP lemma
  • Youla parameterization

Fingerprint

Dive into the research topics of 'A cutting plane algorithm for frequency domain specification with application to bending modes attenuation'. Together they form a unique fingerprint.

Cite this