We've detected a paper from Fixed Point Theory and Algorithms for Sciences and Engineering that cites a retracted paper post-retraction. Citing paper: https://t.co/4Xewl0BNyC Retracted paper: https://t.co/wQt7zrr4O5
RT @mathOCb: This https://t.co/sONuRbnhTk has been replaced. Links: https://t.co/26oTTH3j0q https://t.co/3aiHGzgZc3 https://t.co/BG9Ear6gGy…
Circumcentering approximate reflections for solving the convex feasibility problem https://t.co/vO7D0sJgXB
This https://t.co/sONuRbnhTk has been replaced. Links: https://t.co/26oTTH3j0q https://t.co/3aiHGzgZc3 https://t.co/BG9Ear6gGy https://t.co/m0usHl6JYv
numerical experiments, we present a couple of illustrative examples. [5/5 of https://t.co/mQBemPse9o]
theoretical and numerical comparisons of CARM to the original CRM, to the classical method of alternating projections (MAP) and to a correspondent outer-approximate version of MAP, referred to as MAAP. Along with our results and [4/5 of https://t.co/mQBemP
that, in rather general situations, the approximate projections we employ are available under low computational cost. We derive convergence of CARM and linear convergence under an error bound condition. We also present successful [3/5 of https://t.co/mQBe
on exact orthogonal projections, their computation might be costly. In this regard, we introduce the circumcentered approximate-reflection method (CARM), whose reflections rely on outer-approximate projections. The appeal of CARM is [2/5 of https://t.co/mQ
The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with respect to convex sets. Since reflections are based [1/5 of https://t.co/mQ
Guilherme Araújo, Reza Arefidamghani, Roger Behling, Yunier Bello-Cruz, Alfredo Iusem, Luiz-Rafael Santos: Circumcentering approximate reflections for solving the convex feasibility problem https://t.co/sONuRbnhTk https://t.co/HpmplrYDcu