161 search results - page 1 / 33 » Methods for convex and general quadratic programming |
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
EOR
2010
13 years 4 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
KDD
2007
ACM
14 years 4 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
ALT
2004
Springer
14 years 1 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
2008
13 years 4 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...