Sciweavers

Share
COLT
2005
Springer
9 years 1 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and ef´Čüciently approaches an o...
Nikolas List, Hans-Ulrich Simon
ALT
2004
Springer
9 years 5 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
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...
Nikolas List
books