From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems.

Published in: Comput. Optim. Appl. (2024)

Keyphrases

fixed point
floating point
semidefinite programming
variational inequalities
pairwise
dynamic programming
least squares
sufficient conditions
belief propagation
stationary points
bargaining solution