A cone programming approach to the bilinear matrix inequality problem and its geometry
- 1 April 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 77 (1) , 247-272
- https://doi.org/10.1007/bf02614437
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedbackPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the rank minimization problem over a positive semidefinite linear matrix inequalityIEEE Transactions on Automatic Control, 1997
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- A global optimization approach for the BMI problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Topics in Matrix AnalysisPublished by Cambridge University Press (CUP) ,1991
- Generalized linear complementarity problemsMathematical Programming, 1990
- Complementarity Problems over Locally Compact ConesSIAM Journal on Control and Optimization, 1989
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970