Finding best approximation pairs for two intersections of closed convex sets (Q2070342)
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: Finding best approximation pairs for two intersections of closed convex sets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding best approximation pairs for two intersections of closed convex sets |
scientific article |
Statements
Finding best approximation pairs for two intersections of closed convex sets (English)
0 references
24 January 2022
0 references
Aharoni-Censor-Jiang algorithm
0 references
best approximation pair
0 references
Douglas-Rachford algorithm
0 references
dual-based proximal method
0 references
proximal distance algorithm
0 references
stochastic subgradient descent
0 references
0 references
0 references
0 references
0.8292567133903503
0 references
0.7957467436790466
0 references
0.7716054320335388
0 references
0.76456618309021
0 references
