Daniel Reem

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 9

Top Topics

Projection Method

Gradient Method

Top Venues

J. Approx. Theory

J. Optim. Theory Appl.

Discret. Comput. Geom.

Publications

Yair Censor, Rafiq Mansour, Daniel Reem
The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets. J. Approx. Theory 301 (2024)
Yair Censor, Rafiq Mansour, Daniel Reem
The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets. CoRR (2023)
Daniel Reem
The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs. Theor. Comput. Sci. 970 (2023)
Yair Censor, Daniel Reem, Maroun Zaknoon
A generalized block-iterative projection method for the common fixed point problem induced by cutters. J. Glob. Optim. 84 (4) (2022)
Daniel Reem, Simeon Reich, Alvaro R. De Pierro
A Telescopic Bregmanian Proximal Gradient Method Without the Global Lipschitz Continuity Assumption. J. Optim. Theory Appl. 182 (3) (2019)
Aviv Gibali, Karl-Heinz Küfer, Daniel Reem, Philipp Süss
A generalized projection-based scheme for solving convex constrained optimization problems. Comput. Optim. Appl. 70 (3) (2018)
Daniel Reem
On the Computation of Zone and Double Zone Diagrams. Discret. Comput. Geom. 59 (2) (2018)
Daniel Reem, Simeon Reich, Alvaro R. De Pierro
Re-examination of Bregman functions and new properties of their divergences. CoRR (2018)
Daniel Reem, Simeon Reich, Alvaro R. De Pierro
BISTA: a Bregmanian proximal gradient method without the global Lipschitz continuity assumption. CoRR (2018)
Yair Censor, Daniel Reem
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods. Math. Program. 152 (1-2) (2015)
Daniel Reem, Alvaro R. De Pierro
A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors. CoRR (2015)
Daniel Reem
Topological properties of sets represented by an inequality involving distances CoRR (2013)
Daniel Reem
On the existence of a neutral region CoRR (2012)
Daniel Reem
On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs CoRR (2012)
Daniel Reem
The geometric stability of Voronoi diagrams in normed spaces which are not uniformly convex CoRR (2012)
Daniel Reem
On the Existence of a Neutral Region. ISVD (2012)
Daniel Reem
On the computation of zone and double zone diagrams CoRR (2012)
Daniel Reem
Character Analysis Using Fourier Series. Am. Math. Mon. 119 (3) (2012)
Daniel Reem
The geometric stability of voronoi diagrams with respect to small changes of the sites. SCG (2011)
Daniel Reem
The geometric stability of Voronoi diagrams with respect to small changes of the sites CoRR (2011)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
Distance k-sectors exist. Comput. Geom. 43 (9) (2010)
Eva Kopecká, Daniel Reem, Simeon Reich
Zone diagrams in compact subsets of uniformly convex normed spaces CoRR (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
-sectors exist. SCG (2010)
Eva Kopecká, Daniel Reem, Simeon Reich
Existence of zone diagrams in compact subsets of uniformly convex spaces. CCCG (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
Distance k-Sectors Exist CoRR (2009)
Daniel Reem
An Algorithm for Computing Voronoi Diagrams of General Generators in General Normed Spaces. ISVD (2009)
Daniel Reem
Problem 11352. Am. Math. Mon. 115 (3) (2008)
Daniel Reem, Simeon Reich
Zone and double zone diagrams in abstract spaces. CoRR (2007)