Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods

DOI10.1109/TAC.2018.2808442MaRDI QIDQ4562793zbMATH OpenOpenAlexWikidataFDO

Authors Goran Banjac, Paul J. Goulart

Publication date 18 December 2018

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2018.2808442

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Convex programming (90C25) Programming in abstract spaces (90C48)

Recommendations

• Tight global linear convergence rate bounds for Douglas-Rachford splitting
• Convergence rate analysis of an operator splitting method for solving a class of variational inequality problems
• On the convergence rate of Douglas-Rachford operator splitting method
• scientific article; zbMATH DE number 7544005
• On the linear convergence rate of a relaxed forward–backward splitting method
• On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities
• On the linear stability of splitting methods
• Global convergence of splitting methods for nonconvex composite optimization
• Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces
• Convergence rate analysis of several splitting schemes

Cited in

(11)

• Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence
• Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
• Tight coefficients of averaged operators via scaled relative graph
• Infeasibility detection in the alternating direction method of multipliers for convex optimization
• An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
• scientific article; zbMATH DE number 7544005 (Why is no real title available?)
• Scaled relative graphs of normal matrices
• Networked agents with heterogeneous constraints: equilibria and their stability
• Coordinate-update algorithms can efficiently detect infeasible optimization problems
• OSQP: an operator splitting solver for quadratic programs
• Local R-linear convergence of ADMM-based algorithm for _1-norm minimization with linear and box constraints

This page was built for publication: Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4562793)