7 papers
Finitely Convergent Iterative Methods with Overrelaxations Revisited
Victor I. Kolobov, Simeon Reich, Rafał Zalas
We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that cer…
Finding Subgraphs in Highly Dynamic Networks
Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman
In this paper we consider the fundamental problem of finding subgraphs in highly dynamic distributed networks - networks which allow an arbitrary number of links to be inserted / d…
Finitely Convergent Deterministic and Stochastic Iterative Methods for Solving Convex Feasibility Problems
Victor I. Kolobov, Simeon Reich, Rafał Zalas
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume t…
Fast Deterministic Algorithms for Highly-Dynamic Networks
Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov +2
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each roun…
Observation of thermal Hawking radiation at the Hawking temperature in an analogue black hole
Juan Ramón Muñoz de Nova, Katrine Golubkov, Victor I. Kolobov +1
We measure the correlation spectrum of the Hawking radiation emitted by an analogue black hole and find it to be thermal at the Hawking temperature implied by the analogue surface…
Linear Convergence Rates for Extrapolated Fixed Point Algorithms
Christian Bargetz, Victor I. Kolobov, Simeon Reich +1
We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This a…