Sciweavers

143 search results - page 5 / 29
» Subgradient methods and consensus algorithms for solving con...
Sort
View
103
Voted
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 9 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
138
Voted
ICML
2006
IEEE
16 years 3 months ago
Convex optimization techniques for fitting sparse Gaussian graphical models
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in such a way that the inverse is sparse, thus providing model selection. Beginnin...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
139
Voted
ICPR
2008
IEEE
16 years 4 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
160
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 2 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
109
Voted
JPDC
2007
84views more  JPDC 2007»
15 years 2 months ago
Distributed average consensus with least-mean-square deviation
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile a...
Lin Xiao, Stephen P. Boyd, Seung-Jean Kim