On the Convergence of a Regularized Jacobi Algorithm for Convex Optimization

DOI10.1109/TAC.2017.2737319zbMATH Open1390.90421OpenAlexW2742599086WikidataQ120716817 ScholiaQ120716817MaRDI QIDQ4567170FDOQ4567170

Authors: Goran Banjac, Kostas Margellos, Paul J. Goulart 

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)

Cited In (4)

• On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions
• Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
• Synchronous parallel block coordinate descent method for nonsmooth convex function minimization

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

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