Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
From MaRDI portal
Publication:4562793
DOI10.1109/TAC.2018.2808442zbMath1423.90175OpenAlexW2793153125WikidataQ120716815 ScholiaQ120716815MaRDI QIDQ4562793
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
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Programming in abstract spaces (90C48)
Related Items (6)
Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence ⋮ Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints ⋮ Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry ⋮ Tight coefficients of averaged operators via scaled relative graph ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization
This page was built for publication: Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
