Accelerated proximal point method for maximally monotone operators
From MaRDI portal
Publication:2235140
DOI10.1007/s10107-021-01643-0zbMath1478.90089arXiv1905.05149OpenAlexW3136976430MaRDI QIDQ2235140
Publication date: 20 October 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05149
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Discrete approximations in optimal control (49M25)
Related Items
Optimal error bounds for non-expansive fixed-point iterations in normed spaces ⋮ Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Fast continuous dynamics inside the graph of subdifferentials of nonsmooth convex functions ⋮ Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\) ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ First order inertial optimization algorithms with threshold effects associated with dry friction ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Fast continuous dynamics inside the graph of maximally monotone operators ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems ⋮ Strongly convergent inertial proximal point algorithm without on-line rule ⋮ Fast convergence of generalized forward-backward algorithms for structured monotone inclusions ⋮ Convergence results of two-step inertial proximal point algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Optimized first-order methods for smooth convex minimization
- On the ergodic convergence rates of a first-order primal-dual algorithm
- An optimal variant of Kelley's cutting-plane method
- Gradient methods for minimizing composite functions
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- On the convergence rate of the Halpern-iteration
- An inertial forward-backward algorithm for monotone inclusions
- Monotone (nonlinear) operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Produits infinis de resolvantes
- On parallel complexity of nonsmooth convex optimization
- Monotone operator theory in convex optimization
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
- First-order optimization algorithms via inertial systems with Hessian driven damping
- Efficient first-order methods for convex minimization: a constructive approach
- Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
- Performance of first-order methods for smooth convex minimization: a novel approach
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- Adaptive restart for accelerated gradient schemes
- Multiplier and gradient methods
- On the monotonicity of the gradient of a convex function
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Graph Implementations for Nonsmooth Convex Programs
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Modified Lagrangians in convex programming and their generalizations
- Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization
- Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)
- Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection
- Fast Alternating Direction Optimization Methods
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
- Convergence Rate Analysis of Several Splitting Schemes
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- Proximité et dualité dans un espace hilbertien
- Some methods of speeding up the convergence of iteration methods
- An introduction to continuous optimization for imaging
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Accelerated proximal point method for maximally monotone operators