Exploiting separability in large-scale linear support vector machine training

DOI10.1007/s10589-009-9296-8zbMath1219.90210OpenAlexW2121116595MaRDI QIDQ540649

Kristian Woodsend, Jacek Gondzio

Publication date: 3 June 2011

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

Full work available at URL: https://doi.org/10.1007/s10589-009-9296-8

zbMATH Keywords

interior point methodsupport vector machineslarge scaleseparable quadratic program

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Quadratic programming (90C20) Interior-point methods (90C51)

Related Items

Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, Supervised classification and mathematical optimization, A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training, Nonlinear optimization and support vector machines, A matrix-free smoothing algorithm for large-scale support vector machines, Nonlinear optimization and support vector machines, High-Performance Parallel Support Vector Machine Training, Nearest neighbors methods for support vector machines

Uses Software

• HOPDM
• OOQP
• LIBSVM
• SVMTorch
• RSVM
• Algorithm 539

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• Linear programming: foundations and extensions
• A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
• Product-form Cholesky factorization in interior point methods for second-order cone programming
• Multiple centrality corrections in a primal-dual method for linear programming
• A convergent decomposition algorithm for support vector machines
• 10.1162/15324430152733142
• 10.1162/15324430260185619
• Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
• Interior-Point Methods for Massive Support Vector Machines
• Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
• Object-oriented software for quadratic programming
• Benchmarking optimization software with performance profiles.