Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection
From MaRDI portal
Publication:5123997
DOI10.1137/19M1304854MaRDI QIDQ5123997
Pontus Giselsson, Ernest K. Ryu, Carolina Bergeling, Adrien B. Taylor
Publication date: 17 September 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.00146
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
On the convergence rate of the Halpern-iteration ⋮ On compositions of special cases of Lipschitz continuous operators ⋮ Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry ⋮ A frequency-domain analysis of inexact gradient methods ⋮ Backward-forward-reflected-backward splitting for three operator monotone inclusions ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ Unnamed Item ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Efficient first-order methods for convex minimization: a constructive approach ⋮ Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions ⋮ Accelerated proximal point method for maximally monotone operators ⋮ Analysis of optimization algorithms via sum-of-squares ⋮ Finding the forward-Douglas-Rachford-forward method ⋮ A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems ⋮ Degenerate Preconditioned Proximal Point Algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- Optimized first-order methods for smooth convex minimization
- Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- The exact information-based complexity of smooth convex minimization
- On the convergence analysis of the optimized gradient method
- On the linear convergence of the alternating direction method of multipliers
- An extragradient-based alternating direction method for convex minimization
- A three-operator splitting scheme and its optimization applications
- Monotone and maximal monotone affine subspaces
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Extension problems for accretive sets in Banach spaces
- Adaptive restart of the optimized gradient method for convex optimization
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- Backward-forward-reflected-backward splitting for three operator monotone inclusions
- Performance of first-order methods for smooth convex minimization: a novel approach
- Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator
- Finding the forward-Douglas-Rachford-forward method
- A note on the forward-Douglas-Rachford splitting for monotone inclusion and convex optimization
- Shadow Douglas-Rachford splitting for monotone inclusions
- On the global and linear convergence of the generalized alternating direction method of multipliers
- A Generalized Forward-Backward Splitting
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- Firmly nonexpansive and Kirszbraun-Valentine extensions: a constructive approach via monotone operator theory
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Convergence Rates in Forward--Backward Splitting
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization
- Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)
- The ADMM Algorithm for Distributed Quadratic Problems: Parameter Selection and Constraint Preconditioning
- Fenchel duality, Fitzpatrick functions and the Kirszbraun–Valentine extension theorem
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- A construction of a maximal monotone extension of a monotone map
- Convex programming in Hilbert space
- A Nonlinear Alternating Direction Method
- On the extension of a vector function so as to preserve a Lipschitz condition
- A Lipschitz Condition Preserving Extension for a Vector Function
- Convex analysis and monotone operator theory in Hilbert spaces
