We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
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 ...
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Can we detect low dimensional structure in high dimensional data sets of images? In this paper, we propose an algorithm for unsupervised learning of image manifolds by semidefinit...