A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-016-9886-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2558001808 / rank | |||
Normal rank | |||
Latest revision as of 19:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual gradient-projection method for large-scale strictly convex quadratic problems |
scientific article |
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
