• DocumentCode
    2565705
  • Title

    Computation of Zames-Falb multipliers revisited

  • Author

    Chang, Michael ; Mancera, Ricardo ; Safonov, Michael

  • Author_Institution
    Dept. of Electr. Eng. - (Syst.), Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    2010
  • fDate
    15-17 Dec. 2010
  • Firstpage
    2438
  • Lastpage
    2443
  • Abstract
    The convex approach to the absolute stability problem is considered. Gapski and Geromel´s algorithm for computing Zames-Falb multipliers, used in determining stability, treats the problem as an optimization problem. It is found that their algorithm may terminate prematurely in some cases, failing to find the optimal multiplier. We propose an improvement that always finds an ascent direction and a multiplier that improves the objective function whenever one exists.
  • Keywords
    absolute stability; optimisation; Gapski-Geromel algorithm; Zames-Falb multipliers; absolute stability problem; objective function; optimization problem; Approximation algorithms; Approximation methods; Artificial neural networks; Optimization; Stability analysis; USA Councils; Zinc;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control (CDC), 2010 49th IEEE Conference on
  • Conference_Location
    Atlanta, GA
  • ISSN
    0743-1546
  • Print_ISBN
    978-1-4244-7745-6
  • Type

    conf

  • DOI
    10.1109/CDC.2010.5717050
  • Filename
    5717050
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2565705