Sciweavers

33 search results - page 5 / 7
» Proximal Interior Point Approach for Solving Convex Semi-inf...
Sort
View
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 8 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
ICCV
2009
IEEE
15 years 14 days ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu
SIAMJO
2008
139views more  SIAMJO 2008»
13 years 7 months ago
An Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
Florian Jarre, Franz Rendl
ICASSP
2008
IEEE
14 years 1 months ago
Cooperative MIMO-beamforming for multiuser relay networks
In this paper, we develop a beamforming algorithm for multiuser MIMO-relaying wireless systems. We consider a relaying scenario with multiple sources transmitting to one or more d...
Amr El-Keyi, Benoît Champagne
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 7 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni