In mathematical optimization and machine learning, Sequential Minimal Optimization (SMO) is an algorithm for solving large quadratic programming (QP) optimization problems, widely used for the training of support vector machines. First developed by John C. Platt in 1999, SMO breaks up large QP problems into a series of smallest possible QP problems, which are then solved analytically.
| Property | Value |
|---|
| dbpprop:abstract
|
- In mathematical optimization and machine learning, Sequential Minimal Optimization (SMO) is an algorithm for solving large quadratic programming (QP) optimization problems, widely used for the training of support vector machines. First developed by John C. Platt in 1999, SMO breaks up large QP problems into a series of smallest possible QP problems, which are then solved analytically.
|
| rdfs:comment
|
- In mathematical optimization and machine learning, Sequential Minimal Optimization (SMO) is an algorithm for solving large quadratic programming (QP) optimization problems, widely used for the training of support vector machines. First developed by John C. Platt in 1999, SMO breaks up large QP problems into a series of smallest possible QP problems, which are then solved analytically.
|
| rdfs:label
|
- Sequential Minimal Optimization
|
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
