A Distributed Asynchronous Method of Multipliers for Constrained Nonconvex Optimization

Abstract

This paper presents a fully asynchronous and distributed approach for tackling optimization problems in which both the objective function and the constraints may be nonconvex. In the considered network setting each node is active upon triggering of a local timer and has access only to a portion of the objective function and to a subset of the constraints. In the proposed technique, based on the method of multipliers, each node performs, when it wakes up, either a descent step on a local augmented Lagrangian or an ascent step on the local multiplier vector. Nodes realize when to switch from the descent step to the ascent one through an asynchronous distributed logic-AND, which detects when all the nodes have reached a predefined tolerance in the minimization of the augmented Lagrangian. It is shown that the resulting distributed algorithm is equivalent to a block coordinate descent for the minimization of the global augmented Lagrangian. This allows one to extend the properties of the centralized method of multipliers to the considered distributed framework. Two application examples are presented to validate the proposed approach: a distributed source localization problem and the parameter estimation of a neural network.

arXiv commentarXiv admin note: substantial text overlap with arXiv:1803.06482

References in corpus (4)

• Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
• Distributed Random Projection Algorithm for Convex Optimization
• Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication
• On the O(1/k) Convergence of Asynchronous Distributed Alternating Direction Method of Multipliers

Cited by in corpus (7)

• Distributed Optimization for Smart Cyber-Physical Networks
• Asynchronous Distributed Learning from Constraints
• A Survey of Distributed Optimization Methods for Multi-Robot Systems
• Randomized Block Proximal Methods for Distributed Stochastic Big-Data Optimization
• Asynchronous Distributed Optimization via Dual Decomposition and Block Coordinate Subgradient Methods
• On the Linear Convergence Rate of the Distributed Block Proximal Method
• Collective Learning