Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044)
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: Set intersection problems: supporting hyperplanes and quadratic programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set intersection problems: supporting hyperplanes and quadratic programming |
scientific article |
Statements
Set intersection problems: supporting hyperplanes and quadratic programming (English)
0 references
9 February 2015
0 references
Dykstra's algorithm
0 references
best approximation problem
0 references
alternating projections
0 references
quadratic programming
0 references
supporting hyperplanes
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0.804208517074585
0 references
0.8026494383811951
0 references
0.7982870936393738
0 references
0.7970931529998779
0 references
0.7950838208198547
0 references
