A convergent decomposition algorithm for support vector machines

DOI10.1007/S10589-007-9044-XzbMath1172.90443OpenAlexW2039707593MaRDI QIDQ2475612

A. Risi, Stefano Lucidi, Laura Palagi, Marco Sciandrone

Publication date: 11 March 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2158/256048

zbMATH Keywords

Support vector machineLarge scale optimizationDecomposition methodsProximal point modification

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (18)

Multi-standard quadratic optimization: Interior point methods and cone programming reformulation ⋮ A decomposition method for large-scale box constrained optimization ⋮ Supervised classification and mathematical optimization ⋮ Distributed algorithms for convex problems with linear coupling constraints ⋮ 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 ⋮ Unnamed Item ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints ⋮ On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds ⋮ Exploiting separability in large-scale linear support vector machine training ⋮ A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training ⋮ Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent ⋮ 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 ⋮ A convergent and efficient decomposition method for the traffic assignment problem ⋮ Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds

Uses Software

• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition algorithm for convex differentiable minimization
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• Evolution towards the maximum clique
• Decomposition methods for differentiable optimization problems over Cartesian product sets
• Objective-derivative-free methods for constrained optimization
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Restricted simplicial decomposition: Computation and extensions
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Calculation of Investment Portfolios with Risk Free Borrowing and Lending
• Optimal Allocations of Continuous Resources to Several Activities with a Concave Return Function—Some Theoretical Results
• Globally convergent block-coordinate techniques for unconstrained optimization
• Partial Proximal Minimization Algorithms for Convex Pprogramming
• Parallel Variable Distribution
• Interior-Point Methods for Massive Support Vector Machines
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
• Downlink beamforming for DS-CDMA mobile radio with multimedia services
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On search directions for minimization algorithms

This page was built for publication: A convergent decomposition algorithm for support vector machines