An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
We consider a multi-agent optimization problem where agents subject to local, intermittent interactions aim to minimize a sum of local objective functions subject to a global inequality constraint and a global state constraint set. In contrast to previous work, we do not require that the objective, constraint functions, and state …