HOẠT ĐỘNG TRONG TUẦN

Time: 9:00 - 10:00 AM, Wednesday, March 05th, 2025

Location: Room 508, building A6, Institute of Mathematics (18 Hoang Quoc Viet, Cau Giay, Hanoi)

Abstract: In this talk, we present a variant of the circumcenter method for the convex feasibility problem (CFP), ensuring finite convergence under a Slater assumption. The method replaces exact projections onto the convex sets with projections onto separating half-spaces, perturbed by positive exogenous parameters that decrease to zero along the iterations. If the perturbation parameters decrease slowly enough, such as the terms of a diverging series, finite convergence is achieved. To the best of our knowledge, this is the first circumcenter method for CFP that guarantees finite convergence.