support vector machine (svm) training problem (max-margin classification; dual is a convex qp) (Q6825311)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
Specialized coordinate descent or qp solvers apply; kernelized duals are qps.
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | support vector machine (svm) training problem (max-margin classification; dual is a convex qp) |
Specialized coordinate descent or qp solvers apply; kernelized duals are qps. |
Statements
0 references
0 references
