Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training

DOI10.1007/s10589-018-9987-0zbMath1405.90095OpenAlexW2789819709WikidataQ130165382 ScholiaQ130165382MaRDI QIDQ1790674

Laura Palagi, Simone Sagratella, Andrea Manno

Publication date: 2 October 2018

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

Full work available at URL: http://hdl.handle.net/11573/1071021

zbMATH Keywords

parallel computingsupport vector machinesbig datadecomposition algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items

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, Introduction to the special issue for SIMAI 2016

Uses Software

• CONV_QP
• GPDT
• LIBSVM
• LIBLINEAR
• Pegasos
• Saga

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
• Pegasos: primal estimated sub-gradient solver for SVM
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• A convergent decomposition algorithm for support vector machines
• An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
• Multipoint methods for separable nonlinear networks
• Parallel Selective Algorithms for Nonconvex Big Data Optimization
• Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
• Optimization Methods for Large-Scale Machine Learning
• On the convergence of a modified version of SVM^lightalgorithm
• Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
• Second-Order SMO Improves SVM Online and Active Learning
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
• Selfish Routing in Capacitated Networks
• Convergence of a generalized SMO algorithm for SVM classifier design
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization