quadratic programming (qp) problems with quadratic objective and linear constraints (convex or indefinite) (Q6825784)
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:
Includes svm duals and trust-region subproblems.
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | quadratic programming (qp) problems with quadratic objective and linear constraints (convex or indefinite) |
Includes svm duals and trust-region subproblems. |
Statements
0 references
0 references
0 references
0 references
0 references
0 references
0 references
