Using an iterative linear solver in an interior-point method for generating support vector machines
DOI10.1007/S10589-008-9228-ZzbMATH Open1208.90184OpenAlexW2061219021MaRDI QIDQ616790FDOQ616790
Authors: E. Michael Gertz, Joshua D. Griffin
Publication date: 12 January 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9228-z
Recommendations
Quadratic programming (90C20) Applications of mathematical programming (90C90) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Remark on algorithm 659
- 10.1162/15324430260185619
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to support vector machines and other kernel-based learning methods.
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- Working set selection using second order information for training support vector machines
- Interior-Point Methods for Massive Support Vector Machines
- 10.1162/15324430152748218
- Title not available (Why is that?)
- An updated set of basic linear algebra subprograms (BLAS)
- Semismooth support vector machines.
- An efficient implementation of an active set method for SVMs
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Maximum-gain working set selection for SVMs
Cited In (3)
Uses Software
This page was built for publication: Using an iterative linear solver in an interior-point method for generating support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616790)