161 search results - page 3 / 33 » Methods for convex and general quadratic programming |
SIAMSC
2008
14 years 11 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
100
click to vote
ICPR
2008
IEEE
16 years 7 days ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
118
click to vote
IJCNN
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
JMLR
2006
14 years 11 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
EOR
2002
14 years 10 months ago
2002
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...