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
(52)- Optimal parameter selections for a general Halpern iteration
- Metastability of the proximal point algorithm with multi-parameters
- Analysis of optimization algorithms via sum-of-squares
- Accelerated proximal point method for maximally monotone operators
- On modified Halpern and Tikhonov-Mann iterations
- Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings
- scientific article; zbMATH DE number 3896209 (Why is no real title available?)
- scientific article; zbMATH DE number 4011840 (Why is no real title available?)
- Convergence of Halpern’s Iteration Method with Applications in Optimization
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- On the rate of convergence of Halpern iterations
- Multiply accelerated value iteration for nonsymmetric affine fixed point problems and application to Markov decision processes
- Optimal error bounds for non-expansive fixed-point iterations in normed spaces
- An ordinary differential equation for modeling Halpern fixed-point Algorithm
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- Convergence analysis of the Halpern iteration with adaptive anchoring parameters
- [[:Publication:6091103|Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}Template:K \right)}\)]]
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Principled analyses and design of first-order methods with inexact proximal operators
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems
- Provably faster gradient descent via long steps
- Incorporating history and deviations in forward-backward splitting
- Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities
- Interpolation conditions for linear operators and applications to performance estimation problems
- On the convergence of the trajectories of the dynamical Moudafi's viscosity approximation system
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
- Accelerated minimax algorithms flock together
- Symplectic discretization approach for developing new proximal point algorithm
- A slight look on a new fixed-point problem
- Efficient methods for solving equilibrium and fixed-point problems using accelerated viscosity-based approximations
- HPPP: Halpern-type preconditioned proximal point algorithms and applications to image restoration
- An inexact Halpern iteration with application to distributionally robust optimization
- An approximation-based regularized extra-gradient method for monotone variational inequalities
- Weak and strong convergence of split Douglas-Rachford algorithms for monotone inclusions
- Accelerating preconditioned ADMM via degenerate proximal point mappings
- A new modified Halpern-type splitting algorithm for solving monotone inclusion problems in reflexive Banach spaces
- HalpernSGD: a Halpern-inspired optimizer for accelerated neural network convergence and reduced carbon footprint
- Linear rates of asymptotic regularity for Halpern-type iterations
- An inexact proximal Newton method for nonconvex composite minimization
- HPR-LP: an implementation of an HPR method for solving linear programming
- Halpern's algorithm for multi-agent nonexpansive operators
- The convergence and numerical analysis of shrinking projection algorithms with two iterative sequences and hybrid midpoint rules in Hilbert spaces
- Anderson acceleration of the proximal point method: the exact adaptive minimax, a spectral phase transition, and optimal safeguarding
- Tikhonov regularization of monotone operator flows not only ensures strong convergence of the trajectories but also speeds up the vanishing of the residuals
- Accelerated gradient descent by concatenation of stepsize schedules
- Asymptotic regularity of a generalised stochastic Halpern scheme
- VFOSA: variance-reduced fast operator splitting algorithms for generalized equations
- A fast Krasnosel'skiĭ-Mann-based policy iteration approach for multi-agent cooperative control systems
- Computer-assisted design of accelerated composite optimization methods: OptISTA
- The rate of convergence of Sinkhorn balancing
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)
