The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets (Q6433619): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jat.2024.106045 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JAT.2024.106045 / rank | |||
Normal rank | |||
Latest revision as of 20:37, 30 December 2024
scientific article; zbMATH DE number 7870167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets |
scientific article; zbMATH DE number 7870167 |
Statements
19 April 2023
0 references
math.OC
0 references
cs.NA
0 references
math.FA
0 references
math.NA
0 references
The alternating simultaneous Halpern–Lions–Wittmann–Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets (English)
0 references
