Sciweavers

1118 search results - page 7 / 224
» Convex Optimization
Sort
View
69
Voted
ICASSP
2008
IEEE
15 years 4 months ago
Learning the kernel via convex optimization
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
Seung-Jean Kim, Argyrios Zymnis, Alessandro Magnan...
66
Voted
TASLP
2010
78views more  TASLP 2010»
14 years 4 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
TIT
2010
114views Education» more  TIT 2010»
14 years 4 months ago
Convergence of min-sum message-passing for convex optimization
Abstract--We establish that the min-sum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems, generalizin...
Ciamac Cyrus Moallemi, Benjamin Van Roy
72
Voted
EOR
2007
113views more  EOR 2007»
14 years 9 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
ALT
2004
Springer
15 years 6 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List