Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
type: Item
instance of: scholarly article
title: Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
zbMATH Open document ID: 1405.90095
author: Andrea Manno
author: L. Palagi
author: Simone Sagratella
published in: Computational Optimization and Applications
publication date: 2018-10-02T00:00:00Z
full work available at URL: http://hdl.handle.net/11573/1071021
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6946579
zbMATH Keywords: decomposition algorithm
zbMATH Keywords: big data
zbMATH Keywords: support vector machines
zbMATH Keywords: parallel computing
describes a project that uses: Saga
describes a project that uses: CONV_QP
describes a project that uses: GPDT
describes a project that uses: LIBSVM
describes a project that uses: Pegasos
describes a project that uses: LIBLINEAR
MaRDI profile type: Publication
OpenAlex ID: W2789819709
cites work: Q4209222
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: Selfish Routing in Capacitated Networks
cites work: Parallel Selective Algorithms for Nonconvex Big Data Optimization
cites work: Q3096176
cites work: Q3093324
cites work: Q3093400
cites work: Second-Order SMO Improves SVM Online and Active Learning
cites work: An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
cites work: Multipoint methods for separable nonlinear networks
cites work: Convergence of a generalized SMO algorithm for SVM classifier design
cites work: Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
cites work: An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
cites work: On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
cites work: A convergent decomposition algorithm for support vector machines
cites work: On the convergence of a modified version of SVMlightalgorithm
cites work: Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
cites work: Pegasos: primal estimated sub-gradient solver for SVM
cites work: Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
cites work: Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
cites work: An introduction to support vector machines and other kernel-based learning methods.
cites work: Q5396606
cites work: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
cites work: Q4822834
cites work: Q3093401
Wikidata QID: Q130165382
DOI: 10.1007/S10589-018-9987-0
Recommended article: Parallel algorithm for support vector machines training and quadratic optimization problems
Recommended article: Two new decomposition algorithms for training bound-constrained support vector machines
Recommended article: Decomposition of linear programs using parallel computation
Recommended article: A parallel decomposition algorithm for training multiclass kernel-based vector machines
Recommended article: Q4917937
Recommended article: A parallel splitting method for separable convex programs
Recommended article: A parallel algorithm for partially separable non-convex global minimization: Linear constraints
Recommended article: Parallel algorithm for training multiclass proximal support vector machines
Recommended article: A convergent decomposition algorithm for support vector machines
description: scientific article; zbMATH DE number 6946579