C1,1 approximations of generalized support vector machines
Davide La Torre
Smoothing methods, extensively used for solving mathematical programming problems and applications, are applied in this paper to approximate some optimization problems arising in the theory of generalized support vector machines. A nonlinear model, which generalizes some previous works, is considered in order to minimize the weighted combination of the error distance and the number of features utilized by the support vector machines. In particular, our smooth approach concerns the use of the class of C1,1 functions to approximate the above nonlinear objects.
Generalized support vector machines, C1,1 functions, optimality
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.