scientific article; zbMATH DE number 7370540

MaRDI QIDQ4998894

Matteo Lapucci, Chih-Jen Lin, Giulio Galvan, Marco Sciandrone

Publication date: 9 July 2021

Full work available at URL: https://jmlr.csail.mit.edu/papers/v22/19-632.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decomposition methodsupport vector machinesworking set selectionsequential minimal optimizationVM

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

A new parallel data geometry analysis algorithm to select training data for support vector machine

Uses Software

• LOQO
• LIBSVM
• RCV1
• CIFAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual coordinate descent methods for logistic regression and maximum entropy models
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Support-vector networks
• An improved gradient projection-based decomposition technique for support vector machines
• A convergent decomposition algorithm for support vector machines
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• LOQO:an interior point code for quadratic programming
• A Parallel Mixture of SVMs for Very Large Scale Problems
• Newton's Method for Large Bound-Constrained Optimization Problems
• Improvements to Platt's SMO Algorithm for SVM Classifier Design
• Algorithmic Learning Theory
• On the working set selection in gradient projection-based decomposition techniques for support vector machines
• Nonlinear optimization and support vector machines
• Benchmarking optimization software with performance profiles.
• A simple decomposition method for support vector machines