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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper establishes the iteration-complexity of a Jacobi-typenon-Euclidean proximal alternating direction method of multipliers (ADMM) forsolving multi-block linearly constrained nonconvex programs. The subproblems ofthis ADMM variant can be solved in parallel and hence the method has greatpotential to solve large scale multi-block linearly constrained nonconvexprograms. Moreover, our analysis allows the Lagrange multiplier to be updatedwith a relaxation parameter in the interval (0, 2).

Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs