On the convergence of a modified version of SVMlightalgorithm

DOI10.1080/10556780512331318209zbMATH Open1072.90042OpenAlexW2011741120MaRDI QIDQ5317752FDOQ5317752

Authors: L. Palagi, Marco Sciandrone 

Publication date: 21 September 2005

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780512331318209

Recommendations

• A convergent decomposition algorithm for support vector machines
• Learning Theory
• Algorithmic Learning Theory
• A new convergent decomposition algorithm for solving large scale support vector machines
• Polynomial-time decomposition algorithms for support vector machines

zbMATH Keywords

support vector machinesdecomposition methodsproximal pointsvm light algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Title not available (Why is that?)
• Convergence of a generalized SMO algorithm for SVM classifier design
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Globally convergent block-coordinate techniques for unconstrained optimization
• Partial Proximal Minimization Algorithms for Convex Pprogramming
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems

Cited In (19)

• Nonlinear optimization and support vector machines
• Nonlinear optimization and support vector machines
• A convergent decomposition algorithm for support vector machines
• Algorithmic Learning Theory
• Learning Theory
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
• On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods
• Title not available (Why is that?)
• On the working set selection in gradient projection-based decomposition techniques for support vector machines
• On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
• An improved gradient projection-based decomposition technique for support vector machines
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
• A decomposition method for Lasso problems with zero-sum constraint
• Data preprocessing in semi-supervised SVM classification
• Margin maximization in spherical separation
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems
• A study on SMO algorithm for solving \(\varepsilon\)-SVR with non-PSD kernels

Uses Software

• SVMlight
• LIBSVM

This page was built for publication: On the convergence of a modified version of SVM^lightalgorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317752)