161 search results - page 12 / 33 » Methods for convex and general quadratic programming |
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...
145
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
168
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
134
Voted
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
136
click to vote
ICASSP
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— This work considers a combination classificationregression based framework with the proposal of using learned kernels in modified support vector regression to provide...