svm-smo-algorithm-2d-subproblems

IN premise — entries/2026/06/21/wiki-Support_vector_machine-chunk-5.md

Created 2026-06-21T09:55:54+00:00

The SMO (Sequential Minimal Optimization) algorithm decomposes the SVM quadratic programming problem into 2-dimensional sub-problems solved analytically, requiring no numerical optimizer or large matrix storage.

Dependents

These beliefs depend on this one:

• IN svm-solver-ecosystem-scale-dependent — SVMs have a rich ecosystem of specialized solvers whose optimal choice depends on problem geometry — SMO decomposes into 2D subproblems for general QP, Pegasos uses stochastic gradient descent in the primal for large-scale problems, LIBLINEAR achieves linear-time iterations for high-dimensional sparse data, and the crossover point between sub-gradient and coordinate descent depends on whether n or d dominates.