A linearly convergent linear-time first-order algorithm for support vector classification with a core set result

DOI10.1287/IJOC.1100.0412MaRDI QIDQ2899129zbMATH OpenOpenAlexFDO

Authors Piyush Kumar, E. Alper Yildirim

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/21900

zbMATH Keywords

support vector machinesFrank-Wolfe algorithmsupport vector classification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Approximation algorithms (68W25)

Recommendations

• Exploiting separability in large-scale linear support vector machine training
• Massive data classification via unconstrained support vector machines
• SVM via saddle point optimization: new bounds and distributed algorithms
• Provably fast training algorithms for support vector machines
• DirectSVM: A simple support vector machine perceptron

Cited in

(3)

• A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
• Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
• SVM via saddle point optimization: new bounds and distributed algorithms

This page was built for publication: A linearly convergent linear-time first-order algorithm for support vector classification with a core set result

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