Parallel multi-block ADMM with \(o(1/k)\) convergence (Q1704845)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel multi-block ADMM with o(1/k) convergence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel multi-block ADMM with \(o(1/k)\) convergence |
scientific article |
Statements
Parallel multi-block ADMM with \(o(1/k)\) convergence (English)
0 references
13 March 2018
0 references
The author propose a Jacobi-Proximal alternating direction method of multipliers in solving the minimization problem with linear constraints. The method is suitable for parallel and distributed computing. An \(o(1/k)\) rate of convergence of the method is established. Several numerical results are used to demonstrate the efficiency of the proposed method in comparison with some existing parallel algorithms. A sufficient condition is provided to guarantee the convergence of the Jacobi-type alternating direction method of multipliers under certain conditions.
0 references
alternating direction method of multipliers
0 references
ADMM
0 references
parallel and distributed computing
0 references
convergence rate
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8589062690734863
0 references
0.85184645652771
0 references
0.8395680785179138
0 references
0.8218415975570679
0 references