Exponentially Convergent Algorithm Design for Constrained Distributed Optimization via Non-smooth Approach
arXiv:2001.00509
Abstract
We consider minimizing a sum of non-smooth objective functions with set constraints in a distributed manner. As to this problem, we propose a distributed algorithm with an exponential convergence rate for the first time. By the exact penalty method, we reformulate the problem equivalently as a standard distributed one without consensus constraints. Then we design a distributed projected subgradient algorithm with the help of differential inclusions. Furthermore, we show that the algorithm converges to the optimal solution exponentially for strongly convex objective functions.
References in corpus (6)
- Discontinuous Dynamical Systems: A tutorial on solutions, nonsmooth analysis, and stability
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Initialization-free Distributed Algorithms for Optimal Resource Allocation with Feasibility Constraints and its Application to Economic Dispatch of Power Systems
- Distributed Discrete-time Optimization in Multi-agent Networks Using only Sign of Relative State
- Improved Convergence Rates for Distributed Resource Allocation
- Exponential Convergence for Distributed Smooth Optimization Under the Restricted Secant Inequality Condition