Abstract
This paper is concerned with the iterative solution of sequences of Karush-Kuhn-Tucker (KKT) systems arising from smoothing Newton-type algorithms applied to support vector machines (SVMs). Every perturbed Newton step is crucial for the efficiency of the overall algorithm. However, the KKT systems based on smoothing reformulation become increasingly ill-conditioned as the smoothing parameter approaches to zero. By exploiting preconditioning techniques, we propose a matrix-free smoothing algorithm for solving large-scale support vector machines. Numerical results and comparisons are given to demonstrate the effectiveness and speed of the algorithm.
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.
