拡張された線形化法に基づく一般的ロバスト制御系設計  [in Japanese] Extended Linearization Algorithms for General Robust Control Synthesis  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

This paper proves that a certain class of nonconvex matrix inequalities is equivalent to linear matrix inequalities (LMIs) plus a nonconvex rank constraint. From the equivalence, this paper proposes two heuristic algorithms, that is extended linearization algorithms, to solve LMIs with a rank constraint using LMI-based approach. Reliability and efficiency of the algorithms are investigated statistically, and then extensive numerical experiments will indicate that the algorithms have a decent performance from the viewpoint of computation in comparison with the existing method: the alternating projection method. It is also important that our approaches can be applied to a large number of other rank-minimization problems over LMIs, for example, the robust well-posedness problem which is an extension of general robust control problems.

Journal

  • Journal of the Japan Society for Simulation Technology

    Journal of the Japan Society for Simulation Technology 24(2), 151-158, 2005-06-15

    日鉄技術情報センタ-

References:  13

Codes

  • NII Article ID (NAID)
    110003969618
  • NII NACSIS-CAT ID (NCID)
    AN00329524
  • Text Lang
    JPN
  • Article Type
    ART
  • ISSN
    02859947
  • NDL Article ID
    7411475
  • NDL Source Classification
    ZM13(科学技術--科学技術一般--データ処理・計算機)
  • NDL Call No.
    Z14-893
  • Data Source
    CJP  NDL  NII-ELS  NDL-Digital 
Page Top