2011
DOI: 10.1109/tsp.2011.2162831
|View full text |Cite
|
Sign up to set email alerts
|

Fast Consensus by the Alternating Direction Multipliers Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
136
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 134 publications
(140 citation statements)
references
References 29 publications
4
136
0
Order By: Relevance
“…In what comes next, we consider two alternatives that are commonly used in the literature (c.f., e.g. [14]). …”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…In what comes next, we consider two alternatives that are commonly used in the literature (c.f., e.g. [14]). …”
Section: Problem Formulationmentioning
confidence: 99%
“…Each data point of the plot is the average of the convergence factors of 50 instances of the randomly generated graphs with the same number of nodes. In the edge-variable scenario, we compare the ADMM iterates to Fast-consensus [14] from the ADMM literature and two recent accelerated consensus schemes: Oreshkin et al [11] and Ghadimi et al [22]. These algorithms include a two-tap memory mechanism in which the values of two-last iterates are taken into account in computing the next iterate.…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…In the literature, there exist several methods dealing with the distributed optimization problem (9), including distributed descent algorithms, Nedic et al (2010), dual averaging methods, Duchi et al (2012), and the ADMM, Boyd et al (2011);Erseghe et al (2011). However, we make use of the ADMM method, which has become a popular approach for solving convex minimization problems by means of parallelization.…”
Section: We Know That If {α T } H T=1 Contains the D Inverses Of The mentioning
confidence: 99%
“…There exist some works dealing with penalty parameter selection for accelerating the convergence rate of ADMM Ghadimi et al (2012); Boley (2013); Teixeira et al (2013). The convergence analysis is also studied in Boyd et al (2011);Erseghe et al (2011);Boley (2013). In what follows, we describe the derivation of the ADMM algorithm for solving problem (9) with a constant penalty parameter.…”
Section: We Know That If {α T } H T=1 Contains the D Inverses Of The mentioning
confidence: 99%
See 1 more Smart Citation