Pages that link to "Item:Q828660"

The following pages link to On the convergence rate of the Halpern-iteration (Q828660):

Displaying 13 items.

• Metastability of the proximal point algorithm with multi-parameters (Q2043306) (← links)
• Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
• Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
• On modified Halpern and Tikhonov-Mann iterations (Q2697004) (← links)
• Optimal error bounds for non-expansive fixed-point iterations in normed spaces (Q6038647) (← links)
• An ordinary differential equation for modeling Halpern fixed-point Algorithm (Q6066911) (← links)
• Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
• Convergence analysis of the Halpern iteration with adaptive anchoring parameters (Q6076248) (← links)
• Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\) (Q6091103) (← links)
• Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)
• Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
• From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems (Q6179877) (← links)