A cone programming approach to the bilinear matrix inequality problem and its geometry
From MaRDI portal
Publication:1373737
zbMATH Open0888.90119MaRDI QIDQ1373737FDOQ1373737
Authors: Mehran Mesbahi, George P. Papavassilopoulos 
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- An introduction to a class of matrix cone programming
- scientific article
- scientific article; zbMATH DE number 1461826
- Conjugate duality for convex programs: A geometric development
- A bilinear approach to cone multipliers. II: Applications
- A geometric method for a class of convex programs
- On cone-invariant linear matrix inequalities
- Cone constraints for solutions of homogeneous bilinear systems
- A cone constrained convex program: structure and algorithms
Cited In (5)
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
- On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems.
- DC Programming Approaches for BMI and QMI Feasibility Problems
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
This page was built for publication: A cone programming approach to the bilinear matrix inequality problem and its geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373737)
