Mathematics – Optimization and Control
Scientific paper
2010-01-15
Mathematics
Optimization and Control
44 pages
Scientific paper
We consider a general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set. The objective function is defined by a sum of local objective functions, while the global constraint set is produced by the intersection of local constraint sets. In particular, we study two cases: one where the equality constraint is absent, and the other where the local constraint sets are identical. We devise two distributed primal-dual subgradient algorithms which are based on the characterization of the primal-dual optimal solutions as the saddle points of the Lagrangian and penalty functions. These algorithms can be implemented over networks with changing topologies but satisfying a standard connectivity property, and allow the agents to asymptotically agree on optimal solutions and optimal values of the optimization problem under the Slater's condition.
Martinez Sonia
Zhu Minghui
No associations
LandOfFree
On distributed convex optimization under inequality and equality constraints via primal-dual subgradient methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On distributed convex optimization under inequality and equality constraints via primal-dual subgradient methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On distributed convex optimization under inequality and equality constraints via primal-dual subgradient methods will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-356307