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

DOI10.1007/s10589-023-00518-8OpenAlexW4386085937MaRDI QIDQ6179877

Quoc Tran Dinh

Publication date: 18 January 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-023-00518-8

zbMATH Keywords

maximally monotone inclusionNesterov's accelerated methodco-coercive equationextra-anchored gradient methodHalpern's fixed-point iteration

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Optimized first-order methods for smooth convex minimization
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• A three-operator splitting scheme and its optimization applications
• On the convergence rate of Douglas-Rachford operator splitting method
• On the convergence rate of the Halpern-iteration
• Accelerated proximal algorithms with a correction term for monotone inclusions
• A modification of the Arrow-Hurwicz method for search of saddle points
• Approximation of fixed points of nonexpansive mappings
• Introductory lectures on convex optimization. A basic course.
• Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
• Generalized monotone operators and their averaged resolvents
• Accelerated proximal point method for maximally monotone operators
• Quantitative results for Halpern iterations of nonexpansive mappings
• Set-valued mappings and enlargement of monotone operators.
• First-order frameworks for continuous Newton-like dynamics governed by maximally monotone operators
• The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• Iterative Algorithms for Nonlinear Operators
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• Variational Analysis
• A variational perspective on accelerated methods in optimization
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Fast convergence of generalized forward-backward algorithms for structured monotone inclusions
• From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective
• Projected Reflected Gradient Methods for Monotone Variational Inequalities
• Signal Recovery by Proximal Forward-Backward Splitting
• Some methods of speeding up the convergence of iteration methods
• Fixed points of nonexpanding maps
• A First Order Method for Solving Convex Bilevel Optimization Problems
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems