DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS

We consider a distributed optimization problem over a multi-agent network, in which the sum of several local convex objective functions is minimized subject to global convex inequality constraints. We first transform the constrained optimization problem to an unconstrained one, using the exact penal...

Full description

Bibliographic Details

Published in:	The ANZIAM journal Vol. 56; no. 2; pp. 160 - 178
Main Authors:	LI, JUEYOU, WU, CHANGZHI, WU, ZHIYOU, LONG, QIANG, WANG, XIANGYU
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.10.2014
Subjects:	Algorithms Computer simulation Constraints Convergence Inequalities Networks Optimization State estimation proximal-gradient method distributed algorithm convex optimization 90C25 exact penalty function method
ISSN:	1446-1811, 1446-8735
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!