On Distributed Convex Optimization Under Inequality and Equality Constraints

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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 57; no. 1; pp. 151 - 164
Main Authors:	Minghui Zhu, Martinez, S.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.01.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Adaptative systems Algorithm design and analysis Algorithms Applied sciences Asymptotic properties Automatic control Computer science; control theory; systems Control theory. Systems Convergence Convex functions Cooperative control distributed optimization Exact sciences and technology Heuristic algorithms Inequalities Lagrangian functions multi-agent systems Network topology Networks Optimal control Optimization Saddle points Studies multi-agent systems Subgradient optimization distributed optimization Cooperative control Transmission protocol Duality Topology Adaptive control Convex programming Saddle point Penalty function Multiagent system Cooperation Distributed algorithm Inequality constraint Equality constraint Primal dual method Distributed control Asymptotic approximation Objective function Lagrangian function
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!