Computational issues in alternating projection algorithms for fixed-order control design.

Eric Bengt Beran, K. Grigoriadis

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    392 Downloads (Pure)

    Abstract

    Alternating projection algorithms have been introduced recently to solve fixed-order controller design problems described by linear matrix inequalities and non-convex coupling rank constraints. In this work, an extensive numerical experimentation using proposed benchmark fixed-order control design examples is used to indicate the computational efficiency of the method. These results indicate that the proposed alternating projections are effective in obtaining low-order controllers for small and medium order problems
    Original languageEnglish
    Title of host publicationProc. American Control Conference, Albuquerque, New Mexico
    PublisherIEEE
    Publication date1997
    Pages81-85
    ISBN (Print)0-7803-3832-4
    DOIs
    Publication statusPublished - 1997
    Event1997 American Control Conference - Albuquerque, NM, United States
    Duration: 4 Jun 19976 Jun 1997
    http://www.ece.unm.edu/controls/ACC97/welcome.html

    Conference

    Conference1997 American Control Conference
    CountryUnited States
    CityAlbuquerque, NM
    Period04/06/199706/06/1997
    Internet address

    Bibliographical note

    Copyright: 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

    Cite this

    Beran, E. B., & Grigoriadis, K. (1997). Computational issues in alternating projection algorithms for fixed-order control design. In Proc. American Control Conference, Albuquerque, New Mexico (pp. 81-85). IEEE. https://doi.org/10.1109/ACC.1997.611759