No label defined (Q4498100)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1495709
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1495709

      Statements

      9 March 2001
      0 references
      bilinear matrix inequalities problem
      0 references
      Lagrange dual problem
      0 references
      control design problem
      0 references
      In this interesting paper a new global algorithm is developed for the so-called bilinear matrix inequalities problems, which are non-convex and NP-hard as shown by \textit{O. Toker} and \textit{H. Özbay} [Proceedings of ACC, 2525-2526 (1995)]. The basic idea consists in constructing a suitable Lagrange dual problem and to use it to compute lower bounds for the new branch-and-bound algorithm. Its global convergence is proved. The paper is rounded off by a good introduction into already known results about the problem, by an application of the algorithm to a robust structure/control design problem together with a lot of numerical results.
      0 references
      0 references
      0 references
      Y. Nakashima
      0 references

      Identifiers