D.C. optimization approach to robust control: Feasibility problems

From MaRDI portal





Global optimization algorithms are designed to solve numerically some difficult non-convex problems arising in robust control of linear systems, namely \(H_\infty\) output feedback control with constant scalings and more general bilinear matrix inequality problems. It is shown how the particular problem structure can be exploited in a branch and bound scheme: branching is performed on a reduced number of variables, whereas bounding is done on d.c. (difference of convex functions) inequalities relaxed to linear or linear matrix constraints. Very preliminary numerical results are described.











This page was built for publication: D.C. optimization approach to robust control: Feasibility problems

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