1118 search results - page 15 / 224 » Convex Optimization |
136
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
This paper suggests a method for multiclass learning with many classes by simultaneously learning shared characteristics common to the classes, and predictors for the classes in t...
165
click to vote
JMLR
2010
15 years 2 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
146
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
117
Voted
JCO
2006
15 years 4 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
130
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...