Dual fast projected gradient method for quadratic programming (Q1947612)
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: Dual fast projected gradient method for quadratic programming |
scientific article; zbMATH DE number 6156585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual fast projected gradient method for quadratic programming |
scientific article; zbMATH DE number 6156585 |
Statements
Dual fast projected gradient method for quadratic programming (English)
0 references
23 April 2013
0 references
quadratic programming
0 references
dual problem
0 references
dual fast gradient method
0 references
convergence rate
0 references
complexity
0 references
0 references
0.7830369472503662
0 references
0.7822229266166687
0 references
0.776901125907898
0 references
0.7765632271766663
0 references
0.7727580666542053
0 references
