A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization (Q5387987)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5279681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization |
scientific article; zbMATH DE number 5279681 |
Statements
A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization (English)
0 references
27 May 2008
0 references
quadratically constrained problems
0 references
gradient projection algorithm
0 references
convex minimization
0 references
rate of convergence analysis
0 references
0.8088787198066711
0 references
0.8080084323883057
0 references
