1092 search results - page 78 / 219 » Convex Methods for Transduction |
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
JDCTA
2010
14 years 4 months ago
2010
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
110
click to vote
TSP
2010
14 years 4 months ago
2010
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...