On distributed convex optimization under inequality and equality constraints

Minghui Zhu, Sonia Martinez

Research output: Contribution to journalArticle

339 Citations (Scopus)

Abstract

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 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 dynamically 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.

Original languageEnglish (US)
Article number6018253
Pages (from-to)151-164
Number of pages14
JournalIEEE Transactions on Automatic Control
Volume57
Issue number1
DOIs
StatePublished - Jan 1 2012

Fingerprint

Convex optimization
Topology

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{c84a4931eb08498cab0d59fea41f2a96,
title = "On distributed convex optimization under inequality and equality constraints",
abstract = "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 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 dynamically 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.",
author = "Minghui Zhu and Sonia Martinez",
year = "2012",
month = "1",
day = "1",
doi = "10.1109/TAC.2011.2167817",
language = "English (US)",
volume = "57",
pages = "151--164",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

On distributed convex optimization under inequality and equality constraints. / Zhu, Minghui; Martinez, Sonia.

In: IEEE Transactions on Automatic Control, Vol. 57, No. 1, 6018253, 01.01.2012, p. 151-164.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On distributed convex optimization under inequality and equality constraints

AU - Zhu, Minghui

AU - Martinez, Sonia

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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 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 dynamically 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.

AB - 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 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 dynamically 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.

UR - http://www.scopus.com/inward/record.url?scp=84855384074&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84855384074&partnerID=8YFLogxK

U2 - 10.1109/TAC.2011.2167817

DO - 10.1109/TAC.2011.2167817

M3 - Article

VL - 57

SP - 151

EP - 164

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 1

M1 - 6018253

ER -