Adaptive Penalty-Based Distributed Stochastic Convex Optimization
Authors:
- 18 June 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 62 (15) , 3924-3938
Abstract
In this work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a fully distributed adaptive diffusion algorithm based on penalty methods that allows the network to cooperatively optimize the global cost function, which is defined as the sum of the individual costs over the network, subject to all constraints. We show that when small constant step-sizes are employed, the expected distance between the optimal solution vector and that obtained at each node in the network can be made arbitrarily small. Two distinguishing features of the proposed solution relative to other approaches is that the developed strategy does not require the use of projections and is able to track drifts in the location of the minimizer due to changes in the constraints or in the aggregate cost itself. The proposed strategy is able to cope with changing network topology, is robust to network disruptions, and does not require global information or rely on central processors.Keywords
All Related Versions
Funding Information
- NSF (CCF-1011918)
This publication has 38 references indexed in Scilit:
- Distributed Detection and Estimation in Wireless Sensor Networks2014
- On distributed online classification in the midst of concept driftsNeurocomputing, 2013
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Distributed Stochastic Subgradient Projection Algorithms for Convex OptimizationJournal of Optimization Theory and Applications, 2010
- A new incremental affine projection-based adaptive algorithm for distributed networksSignal Processing, 2008
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappingsJournal of Approximation Theory, 2008
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Incremental Subgradient Methods for Nondifferentiable OptimizationSIAM Journal on Optimization, 2001
- A New Class of Incremental Gradient Methods for Least Squares ProblemsSIAM Journal on Optimization, 1997
- Distributed asynchronous deterministic and stochastic gradient optimization algorithmsIEEE Transactions on Automatic Control, 1986