143 search results - page 4 / 29 » Subgradient methods and consensus algorithms for solving con... |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
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...
SIAMJO
2002
13 years 7 months ago
2002
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...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
JOTA
2011
13 years 2 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...