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...
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...
Abstract--We establish that the min-sum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems, generalizin...
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...
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...