Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem

DOI10.1023/A:1011224403708zbMath0979.65051OpenAlexW1599634084MaRDI QIDQ5939945

Publication date: 10 February 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011224403708

zbMATH Keywords

algorithms semidefinite programming branch-and-bound cut polytope bilinear matrix inequality eigenvalue problem branch-and-cut convex relaxation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (29)

A heuristic approach to solving a class of bilinear matrix inequality problems ⋮ A BMI approach for ℋ︁_∞ gain scheduling of discrete time-varying systems ⋮ Robust output-feedback controller design via local BMI optimization ⋮ Analysis and design of \(H_\infty\) controllers for 2D singular systems with delays ⋮ Input–output finite-time stabilisation of a class of hybrid systems via static output feedback ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ A space decomposition scheme for maximum eigenvalue functions and its applications ⋮ GPC robust design using linear and/or bilinear matrix inequalities ⋮ Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities ⋮ Output feedback \(H _{\infty }\) control for uncertain piecewise linear systems ⋮ Robust guaranteed cost decentralized stabilization for uncertain discrete large-scale systems with delays via state feedback and output feedback ⋮ Exponential admissibility and \(H_\infty\) control of switched singular time-delay systems: an average dwell time approach ⋮ A robust override scheme enforcing strict output constraints for a class of strictly proper systems ⋮ Novel estimations for the eigenvalue bounds of complex interval matrices ⋮ Multiobjective output feedback control of a class of stochastic hybrid systems with state-dependent noise ⋮ SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS ⋮ A fast space-decomposition scheme for nonconvex eigenvalue optimization ⋮ Towards a global controller design for guaranteed synchronization of switched chaotic systems ⋮ \(H_{\infty}\) output feedback control for uncertain stochastic systems with time-varying delays ⋮ A BMI approach to guaranteed cost control of discrete-time uncertain system with both state and input delays ⋮ Control synthesis for polynomial discrete-time systems under input constraints via delayed-state Lyapunov functions ⋮ A test for stability robustness of linear time-varying systems utilizing the linear time-invariant ν-gap metric ⋮ A probabilistic solution of robustH_∞control problem with scaled matrices ⋮ Nonsmooth µ-synthesis ⋮ \(\mathcal H_{\infty }\) filtering for discrete-time linear systems with bounded time-varying parameters ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods ⋮ Supervised-distributed control with joint performance and communication optimisation ⋮ An interior method for nonconvex semidefinite programs ⋮ Successive linearization methods for nonlinear semidefinite programs

Uses Software

This page was built for publication: Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem