8 search results - page 1 / 2 » Error Bounds for Some Semidefinite Programming Approaches to... |
SIAMJO
2010
12 years 11 months ago
2010
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...
SIAMJO
2002
13 years 4 months ago
2002
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
ICASSP
2009
IEEE
13 years 2 months ago
2009
IEEE
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...