On the convergence rate of the Halpern-iteration
From MaRDI portal
(Redirected from Publication:828660)
Recommendations
Cites work
- A first order method for solving convex bilevel optimization problems
- Approximation of fixed points of nonexpansive mappings
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces
- Fixed points of nonexpanding maps
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Iterative Algorithms for Nonlinear Operators
- On quantitative versions of theorems due to F. E. Browder and R. Wittmann
- On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Über die zusammenziehende und Lipschitzsche Transformationen
Cited in
(30)- Convergence analysis of the Halpern iteration with adaptive anchoring parameters
- Metastability of the proximal point algorithm with multi-parameters
- On the convergence of the trajectories of the dynamical Moudafi's viscosity approximation system
- Optimal parameter selections for a general Halpern iteration
- An ordinary differential equation for modeling Halpern fixed-point Algorithm
- The rate of convergence of Sinkhorn balancing
- Optimal error bounds for non-expansive fixed-point iterations in normed spaces
- Interpolation conditions for linear operators and applications to performance estimation problems
- Principled analyses and design of first-order methods with inexact proximal operators
- Provably faster gradient descent via long steps
- Incorporating history and deviations in forward-backward splitting
- Multiply accelerated value iteration for nonsymmetric affine fixed point problems and application to Markov decision processes
- Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems
- Accelerated proximal point method for maximally monotone operators
- Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\)
- Convergence of Halpern’s Iteration Method with Applications in Optimization
- Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities
- scientific article; zbMATH DE number 3896209 (Why is no real title available?)
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
- On modified Halpern and Tikhonov-Mann iterations
- Accelerated minimax algorithms flock together
- On the rate of convergence of Halpern iterations
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- scientific article; zbMATH DE number 4011840 (Why is no real title available?)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
- Analysis of optimization algorithms via sum-of-squares
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
This page was built for publication: On the convergence rate of the Halpern-iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828660)
