Distributed Algorithms for Optimization Problems with Equality Constraints
Date: December 10 - December 13, 2013
In this paper we introduce two discrete-time, distributed optimization algorithms executed by a set of agents whose interactions are subject to a communication graph. The algorithms can be applied to optimization problems where the cost function is expressed as a sum of functions, and where each function is associated to an agent. In addition, the agents can have equality constraints as well. The algorithms are not consensus-based and can be applied to non-convex optimization problems with equality constraints. We demonstrate that the first distributed algorithm results naturally from applying a first order method to solve the first order necessary conditions for a lifted optimization problem with equality constraints; the solution of our original problem is embedded in the solution of this lifted optimization problem. Using an augmented Lagrangian idea, we derive a second distributed algorithm that requires weaker conditions for local convergence compared to the first algorithm. For both algorithms we address the local convergence properties.