The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem (Q5506687)
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 6662670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem |
scientific article; zbMATH DE number 6662670 |
Statements
The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (English)
0 references
13 December 2016
0 references
best approximation
0 references
Hilbert space
0 references
alternating minimization
0 references
Dykstra's algorithm
0 references
supporting halfspace
0 references
quadratic programming strategy
0 references
convergence rate
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.823176920413971
0 references
0.7910661101341248
0 references
0.7878595590591431
0 references
0.7834643721580505
0 references
