A polynomial algorithm for convex quadratic optimization subject to linear inequalities (Q2297665)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial algorithm for convex quadratic optimization subject to linear inequalities |
scientific article; zbMATH DE number 7170038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for convex quadratic optimization subject to linear inequalities |
scientific article; zbMATH DE number 7170038 |
Statements
A polynomial algorithm for convex quadratic optimization subject to linear inequalities (English)
0 references
20 February 2020
0 references
convex optimization
0 references
linear programming
0 references
0 references
0.7934988141059875
0 references
0.7866790294647217
0 references
