Circumcentering approximate reflections for solving the convex feasibility problem

DOI10.1186/S13663-021-00711-6arXiv2105.00497MaRDI QIDQ6366646FDOQ6366646

Roger Behling, Luiz-Rafael Santos, Alfredo Iusem, G. H. M. Araújo, Reza Arefidamghani, Yunier Y. Bello Cruz

Publication date: 2 May 2021

Abstract: 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 on exact 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 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 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 numerical experiments, we present a couple of illustrative examples.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Acceleration of convergence in numerical analysis (65B99)

This page was built for publication: Circumcentering approximate reflections for solving the convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366646)