Sciweavers

213 search results - page 21 / 43
» Semidefinite programming
Sort
View
SIAMJO
2010
108views more  SIAMJO 2010»
13 years 7 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer
ICASSP
2008
IEEE
14 years 3 months ago
Robust adaptive beamforming for general-rank signal models using positive semi-definite covariance constraint
In this paper, we develop an improved approach to the worstcase robust adaptive beamforming for general-rank signal models by means of taking into account the positive semi-defin...
Haihua Chen, Alex B. Gershman
ICASSP
2011
IEEE
13 years 10 days ago
Worst-case based robust adaptive beamforming for general-rank signal models using positive semi-definite covariance constraint
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
Haihua Chen, Alex B. Gershman
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 3 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 3 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz