The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets

DOI10.1016/J.JAT.2024.106045arXiv2304.09600OpenAlexW4395704244MaRDI QIDQ6433619

Rafiq Mansour, Daniel Reem, Yair Censor

Publication date: 19 April 2023

Full work available at URL: https://doi.org/10.1016/j.jat.2024.106045

Mathematics Subject Classification ID

Convex programming (90C25) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Fixed-point theorems (47H10) Best approximation, Chebyshev systems (41A50) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Uniqueness of best approximation (41A52) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Harmonic analysis on Euclidean spaces (42-XX) Approximations and expansions (41-XX)

This page was built for publication: The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets