In this paper we propose an efficient computation approach to minimize the H-infinity-norm of a transfer-function matrix depending affinely on a set of free parameters. The minimization problem, formulated as a semi-infinite convex programming problem, is solved via a relaxation approach over a finite set of frequency values. In this way, a significant speed up is achieved by avoiding the solution of high order LMIs resulting by equivalently formulating the minimization problem as a high dimensional semidefinite programming problem. Numerical results illustrate the superiority of proposed approach over LMIs based techniques in solving zero order H-infinity-norm approximation problems.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Fast Algorithms for Solving H-infinity-Norm Minimization Problems


    Beteiligte:
    Varga, Andras (Autor:in) / Parrilo, Pablo (Autor:in)

    Kongress:

    2001 ; Orlando, Florida (USA)


    Erschienen in:

    Erscheinungsdatum :

    2001-11-01


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Flutter Analysis by Using H-Infinity Norm

    Gu, Y. / Yang, Z. | British Library Conference Proceedings | 2009


    Flutter Analysis by Using H-Infinity Norm

    Gu, Yingsong / Yang, Zhichun | AIAA | 2009


    A Norm-Minimization Algorithm for Solving the Lost-in-Space Problem with XNAV

    Hou, Linyi / Putnam, Zachary R. | Springer Verlag | 2024


    Sequential L ∞  Norm Minimization for Triangulation

    Seo, Yongduek / Hartley, Richard | Springer Verlag | 2007