On the Convergence of a Regularized Jacobi Algorithm for Convex Optimization

DOI10.1109/TAC.2017.2737319zbMath1390.90421OpenAlexW2742599086WikidataQ120716817 ScholiaQ120716817MaRDI QIDQ4567170

Paul J. Goulart, Goran Banjac, Kostas Margellos

Publication date: 27 June 2018

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

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

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Synchronous parallel block coordinate descent method for nonsmooth convex function minimization ⋮ Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method ⋮ New analysis of linear convergence of gradient-type methods via unifying error bound conditions

This page was built for publication: On the Convergence of a Regularized Jacobi Algorithm for Convex Optimization