On the convergence of a modified version of SVMlightalgorithm

DOI10.1080/10556780512331318209zbMath1072.90042OpenAlexW2011741120MaRDI QIDQ5317752

Laura Palagi, Marco Sciandrone

Publication date: 21 September 2005

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

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

zbMATH Keywords

decomposition methodssupport vector machinesproximal pointsvm light algorithm

Mathematics Subject Classification ID

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

Related Items

A Study on SMO Algorithm for Solving ϵ-SVR with Non-PSD Kernels, Margin maximization in spherical separation, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, Data preprocessing in semi-supervised SVM classification, An improved gradient projection-based decomposition technique for support vector machines, 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, A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training, Nonlinear optimization and support vector machines, Nonlinear optimization and support vector machines, Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training, Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds, A decomposition method for Lasso problems with zero-sum constraint

Uses Software

• SVMlight
• LIBSVM

Cites Work

• Unnamed Item
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• 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
• Convergence of a generalized SMO algorithm for SVM classifier design