The DOI matches its Crossref record.
Generalized Support Vector Machines
Abstract
An implicit Lagrangian for the dual of a simple reformulation of the standard quadratic program of a linear support vector machine is proposed. This leads to the minimization of an unconstrained differentiable convex function in a space of dimensionality equal to the number of classified points. This problem is solvable by an extremely simple linearly convergent Lagrangian support vector machine (LSVM) algorithm. LSVM requires the inversion at the outset of a single matrix of the order of the much smaller dimensionality of the original input space plus one. The full algorithm is given in this paper in 11 lines of MATLAB code without any special optimization tools such as linear or quadratic programming solvers. This LSVM code can be used “as is ” to solve classification problems with millions of points. For example, 2 million points in 10 dimensional input space were classified by a linear surface in 82 minutes on a Pentium III 500 MHz notebook with 384 megabytes of memory (and additional swap space), and in 7 minutes on a 250 MHz UltraSPARC II processor with 2 gigabytes of memory. Other standard classification test problems were also solved. Nonlinear kernel classification can also be solved by LSVM. Although it does not scale up to very large problems, it can handle any positive semidefinite kernel and is guaranteed to converge. A short MATLAB code is also given for nonlinear kernels and tested on a number of problems. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Proximal support vector machine classifiers
Fung, G., & Mangasarian, O. L. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502527 · Cited by 842
Self-citationMultisurface proximal support vector machine classification via generalized eigenvalues
Mangasarian, O. L., & Wild, E. W. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.17 · Cited by 793
Self-citationRSVM: Reduced Support Vector Machines
Lee, Y.-J., & Mangasarian, O. L. (2001) · Proceedings of the 2001 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.13 · Cited by 647
Self-citationAggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
SSVM: A Smooth Support Vector Machine for Classification
Lee, Y.-J., & Mangasarian, O. L. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011215321374 · Cited by 518
Self-citation
Metadata
- Authors
- Mangasarian, O. L.
- Venue
- Advances in Large-Margin Classifiers
- Publisher
- The MIT Press
- Published
- 2000-09-29
- Pages
- 135-146
- OpenAlex
- W1589603734
- Cited by
- 298
- References
- 0
- FWCI
- 28.12
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalized Support Vector Machines. https://app.cochat.ai/papers/10.7551/mitpress/1113.003.0012
- The paper
- Mangasarian, O. L. (2000). Generalized Support Vector Machines. Advances in Large-Margin Classifiers. https://doi.org/10.7551/mitpress/1113.003.0012
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.