Distributed constrained convex optimization and consensus via dual decomposition and proximal minimization
We consider a general class of convex optimization problems over time-varying, multi-agent networks, that naturally arise in many application domains like energy systems and wireless networks. In particular, we focus on programs with separable objective functions, local (possibly different) constrai...
Main Authors: | , , , |
---|---|
Format: | Conference item |
Published: |
Institute of Electrical and Electronics Engineers
2016
|