• DocumentCode
    846950
  • Title

    Majorization: a computational complexity reduction technique in control system design

  • Author

    Polak, Elijah ; Stimler, Daniel M.

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
  • Volume
    33
  • Issue
    11
  • fYear
    1988
  • Firstpage
    1010
  • Lastpage
    1021
  • Abstract
    A methodology is presented for transcribing worst-case control-system design specifications into semi-infinite inequalities of low computational complexity, which are tractable by semi-infinite programming algorithms. These algorithms can be used to find a design which satisfies specifications or to find a design which satisfies specifications and minimizes a cost. A computational example is given.<>
  • Keywords
    computational complexity; control system CAD; computational complexity; control system CAD; majorisation; semi-infinite inequalities; semi-infinite programming algorithms; Aging; Algorithm design and analysis; Computational complexity; Control system synthesis; Control systems; Costs; Error correction; Frequency; Laboratories; Uncertainty;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.14413
  • Filename
    14413
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=846950