A unified and tight linear convergence analysis of the relaxed proximal point algorithm
From MaRDI portal
Publication:2691350
DOI10.3934/jimo.2022107OpenAlexW4285283990MaRDI QIDQ2691350
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.04537
proximal point algorithmlinear convergence ratemaximal monotone operator inclusion problemstight convergence rate
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the convergence rate of Douglas-Rachford operator splitting method
- Metric subregularity and the proximal point method
- 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
- On the optimal linear convergence rate of a generalized proximal point algorithm
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Multiplier and gradient methods
- 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
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- Proximité et dualité dans un espace hilbertien