scientific article; zbMATH DE number 1495709

From MaRDI portal
Publication:4498100





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.




Cited in
(24)


Describes a project that uses

Uses Software






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4498100)