A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229)
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 dual gradient-projection method for large-scale strictly convex quadratic problems |
scientific article; zbMATH DE number 6754768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual gradient-projection method for large-scale strictly convex quadratic problems |
scientific article; zbMATH DE number 6754768 |
Statements
A dual gradient-projection method for large-scale strictly convex quadratic problems (English)
0 references
28 July 2017
0 references
convex optimization
0 references
quadratic programming
0 references
gradient projection
0 references
large-scale optimization
0 references
sparse factorizations
0 references
dual method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.793887734413147
0 references
0.7930939197540283
0 references
0.776901125907898
0 references
0.7691625952720642
0 references
0.7662883996963501
0 references
