143 search results - page 3 / 29 » Subgradient methods and consensus algorithms for solving con... |
JMLR
2010
13 years 16 days ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
SIAMJO
2000
13 years 5 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
TKDE
2012
11 years 8 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...