A sparse semismooth Newton based augmented Lagrangian method for large-scale support vector machines

by   Dunbiao Niu, et al.

Support vector machines (SVMs) are successful modeling and prediction tools with a variety of applications. Previous work has demonstrated the superiority of the SVMs in dealing with the high dimensional, low sample size problems. However, the numerical difficulties of the SVMs will become severe with the increase of the sample size. Although there exist many solvers for the SVMs, only few of them are designed by exploiting the special structures of the SVMs. In this paper, we propose a highly efficient sparse semismooth Newton based augmented Lagrangian method for solving a large-scale convex quadratic programming problem with a linear equality constraint and a simple box constraint, which is generated from the dual problems of the SVMs. By leveraging the primal-dual error bound result, the fast local convergence rate of the augmented Lagrangian method can be guaranteed. Furthermore, by exploiting the second-order sparsity of the problem when using the semismooth Newton method, the algorithm can efficiently solve the aforementioned difficult problems. Finally, numerical comparisons demonstrate that the proposed algorithm outperforms the current state-of-the-art solvers for the large-scale SVMs.


page 1

page 2

page 3

page 4


A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems

Square-root Lasso problems are proven robust regression problems. Furthe...

An Efficient Augmented Lagrangian Method with Semismooth Newton Solver for Total Generalized Variation

Total generalization variation (TGV) is a very powerful and important re...

Augmented Lagrangian Method for Second-Order Cone Programs under Second-Order Sufficiency

This paper addresses problems of second-order cone programming important...

Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for Sparsity Regularized Estimation

We analyze the convergence behaviour of a recently proposed algorithm fo...

Evaluating robustness of support vector machines with the Lagrangian dual approach

Adversarial examples bring a considerable security threat to support vec...

A Foray into Parallel Optimisation Algorithms for High Dimension Low Sample Space Generalized Distance Weighted Discrimination problems

In many modern data sets, High dimension low sample size (HDLSS) data is...

Fast Projection onto the Capped Simplex withApplications to Sparse Regression in Bioinformatics

We consider the problem of projecting a vector onto the so-called k-capp...

Please sign up or login with your details

Forgot password? Click here to reset