A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization

  title={A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization},
  author={Tsung-Hui Chang},
  journal={IEEE Transactions on Signal Processing},
This paper considers a convex optimization problem with a globally coupled linear equality constraint and local polyhedron constraints and develops efficient distributed optimization methods. The considered problem has many engineering applications. Due to the polyhedron constraints, agents in the existing methods have to deal with polyhedron constrained subproblems at each iteration. One of the key challenges is that projection onto a polyhedron set is not trivial, which prohibits the agents… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS


Publications citing this paper.
Showing 1-10 of 21 extracted citations

A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach

IEEE Transactions on Control of Network Systems • 2018
View 5 Excerpts
Highly Influenced

Multi-agent constrained optimization of a strongly convex function over time-varying directed networks

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) • 2017
View 7 Excerpts
Highly Influenced

An ADMM approach to dynamic sharing problems

2018 52nd Annual Conference on Information Sciences and Systems (CISS) • 2018
View 1 Excerpt

Distributed Linearized ADMM for Network Cost Minimization

IEEE Transactions on Signal and Information Processing over Networks • 2018
View 1 Excerpt

A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs

IEEE Transactions on Signal Processing • 2017
View 2 Excerpts


Publications referenced by this paper.
Showing 1-10 of 38 references

CVX: Matlab software for disciplined convex programming

M. Grant, S. Boyd
v. 1.21, • 2011
View 3 Excerpts
Highly Influenced

Subgradient methods

S. Boyd, A. Mutapcic
[Online] Available: www.stanford.edu/class/ee392o/subgrad_method.pdf.
View 18 Excerpts
Highly Influenced

Proximal algorithms

N. Parikh, S. Boyd
Found. Trends Optim., vol. 1, no. 3, pp. 1–112, 2013. • 2013
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…