On the Convergence of a Regularized Jacobi Algorithm for Convex Optimization

DOI10.1109/TAC.2017.2737319MaRDI QIDQ4567170zbMATH OpenOpenAlexWikidataFDO

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)

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

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)