Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A cone programming approach to the bilinear matrix inequality problem and its geometry

From MaRDI portal
Publication:1373737
Jump to:navigation, search

zbMath0888.90119MaRDI QIDQ1373737

George P. Papavassilopoulos, Mehran Mesbahi

Publication date: 25 November 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)


zbMATH Keywords

linear complementaritybilinear matrix inequality


Mathematics Subject Classification ID

Linear programming (90C05)


Related Items

DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems. ⋮ Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1373737&oldid=13523489"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki