• DocumentCode
    2407757
  • Title

    Mixed μ problems and branch and bound techniques

  • Author

    Newlin, Matthew P. ; Young, Peter M.

  • Author_Institution
    Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
  • fYear
    1992
  • fDate
    1992
  • Firstpage
    3175
  • Abstract
    The computation of the general structural singular value (μ) is NP hard. Therefore, quick solutions to medium sized problems must often be approximate. In many of the cases where the current approximate methods are unsatisfactory, improved solutions can be obtained. It is shown that, despite its combinatoric nature, branch and bound techniques can give substantially improved solutions with only moderate computational cost
  • Keywords
    combinatorial mathematics; control system analysis; control system synthesis; optimisation; stability; NP hard; branch and bound techniques; general structural singular value; mixed mu problems; Combinatorial mathematics; Computational efficiency; Convergence; Eigenvalues and eigenfunctions; Knowledge engineering; Mathematical model; Polynomials; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1992., Proceedings of the 31st IEEE Conference on
  • Conference_Location
    Tucson, AZ
  • Print_ISBN
    0-7803-0872-7
  • Type

    conf

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