From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems

Documenti analoghi

• Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
  di: Tran-Dinh, Quoc, et al.
  Pubblicazione: (2023)
• Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
  di: Tran-Dinh, Quoc
  Pubblicazione: (2024)
• A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
  di: Nguyen-Trung, Nghia, et al.
  Pubblicazione: (2025)
• Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed point Problems
  di: Iiduka, Hideaki
  Pubblicazione: (2026)
• The Iterates of Nesterov's Accelerated Algorithm Converge in The Critical Regimes
  di: Bot, Radu Ioan, et al.
  Pubblicazione: (2025)