A hybrid gradient method for strictly convex quadratic programming (Q4959588)
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 hybrid gradient method for strictly convex quadratic programming |
scientific article; zbMATH DE number 7396243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid gradient method for strictly convex quadratic programming |
scientific article; zbMATH DE number 7396243 |
Statements
A hybrid gradient method for strictly convex quadratic programming (English)
0 references
16 September 2021
0 references
convex quadratic optimization
0 references
gradient methods
0 references
linear system of equations
0 references
0.8315796256065369
0 references
0.8168123364448547
0 references
0.8000611662864685
0 references
0.7846944332122803
0 references
