English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The Alternating Direction Method of Multipliers (ADMM) is widely used for linearly constrained convex problems. It is proven to have an \(o(1{/}\sqrt{K})\) nonergodic convergence rate and a faster O(1 / K) ergodic rate after ergodic averaging, where K is the number of iterations. Such nonergodic convergence rate is not optimal. Moreover, the ergodic averaging may destroy the sparseness and low-rankness in sparse and low-rank learning. In this paper, we modify the accelerated ADMM proposed in Ouyang et al. (SIAM J. Imaging Sci. 7(3):1588–1623, 2015) and give an O(1 / K) nonergodic convergence rate analysis, which satisfies \(|F(\mathbf {x}^K)-F(\mathbf {x}^*)|\le O(1{/}K)\), \(\Vert \mathbf {A}\mathbf {x}^K-\mathbf {b}\Vert \le O(1{/}K)\) and \(\mathbf {x}^K\) has a more favorable sparseness and low-rankness than the ergodic peer, where \(F(\mathbf {x})\) is the objective function and \(\mathbf {A}\mathbf {x}=\mathbf {b}\) is the linear constraint. As far as we know, this is the first O(1 / K) nonergodic convergent ADMM type method for the general linearly constrained convex problems. Moreover, we show that the lower complexity bound of ADMM type methods for the separable linearly constrained nonsmooth convex problems is O(1 / K), which means that our method is optimal.

Accelerated Alternating Direction Method of Multipliers: An Optimal O(1 / K) Nonergodic Analysis