Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization
Given an undirected graph G = (N, E) of agents N = {1,..., N} connected with edges in E, we study how to compute an optimal decision on which there is consensus among agents and that minimizes the sum of agent-specific private convex composite functions {Φ i } i∈N , where Φ i ≐ ξ i + f i belongs to...
Saved in:
Published in | IEEE transactions on automatic control Vol. 63; no. 1; pp. 5 - 20 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.01.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!