Resultats globals: 2 registres trobats en 0.03 segons.
Articles, 2 registres trobats
Articles 2 registres trobats  
1.
26 p, 1.3 MB A cone programming approach to the bilinear matrix inequality problem and its geometry / Mesbahi, Mehran ; Papavassilopoulos, George P.
We discuss an approach for solving the Bilinear Matrix Inequality (BMI) based on its connections with certain problems defined over matrix cones. These problems are, among others, the cone generalization of the linear programming (LP) and the linear complementarity problem (LCP) (referred to as the Cone-LP and the Cone-LCP, respectively). [...]
1997
Mathematical Programming, vol. 77 n. 2 (1997) p. 247-272  
 Accés restringit a la UAB
2.
28 p, 1.1 MB The Projective Method for solving linear matrix inequalities / Gahinet, Pascal ; Nemirovski, Arkadi
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. [...]
1997
Mathematical Programming, vol. 77 n. 2 (1997) p. 163-190  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.