Abstract
Decomposition methods play an important role in solving large-scale quadratic programming (QP) problems arising from support vector machines (SVMs). In this paper, we study convergence of general decomposition methods for SVMs. We prove that, under a mild condition on the working set selection, a decomposition algorithm stops within a finite number of iterations after reaching a solution of the QP problem satisfying a relaxed Karush–Kuhn–Tucker (KKT) condition which has been often used so far. Further, it is shown that the working set selection used in the implementation of SVMlight satisfies the condition given in this paper, so SVMlight has the finite termination property without the stronger assumption than the positive-semi-definiteness on the Hessian matrix of the objection function.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
