Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
From MaRDI portal
Abstract: Various distributed optimization methods have been developed for solving problems which have simple local constraint sets and whose objective function is the sum of local cost functions of distributed agents in a network. Motivated by emerging applications in smart grid and distributed sparse regression, this paper studies distributed optimization methods for solving general problems which have a coupled global cost function and have inequality constraints. We consider a network scenario where each agent has no global knowledge and can access only its local mapping and constraint functions. To solve this problem in a distributed manner, we propose a consensus-based distributed primal-dual perturbation (PDP) algorithm. In the algorithm, agents employ the average consensus technique to estimate the global cost and constraint functions via exchanging messages with neighbors, and meanwhile use a local primal-dual perturbed subgradient method to approach a global optimum. The proposed PDP method not only can handle smooth inequality constraints but also non-smooth constraints such as some sparsity promoting constraints arising in sparse optimization. We prove that the proposed PDP algorithm converges to an optimal primal-dual solution of the original problem, under standard problem and network assumptions. Numerical results illustrating the performance of the proposed algorithm for a distributed demand response control problem in smart grid are also presented.
Cited in
(62)- Optimal distributed stochastic mirror descent for strongly convex optimization
- Exponential convergence of a distributed algorithm for solving linear algebraic equations
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Distributed constraint optimization on networked multi-agent systems
- Convergence of the augmented decomposition algorithm
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- Network-decentralised optimisation and control: an explicit saturated solution
- Distributed optimization of multiagent systems in directed networks with time-varying delay
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Distributed multi-UAV trajectory optimization over directed networks
- Distributed resource allocation via multi-agent systems under time-varying networks
- A multi-scale method for distributed convex optimization with constraints
- Gradient-free distributed optimization with exact convergence
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- Tracking-ADMM for distributed constraint-coupled optimization
- Online supervised learning with distributed features over multiagent system
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Surrogate-based distributed optimisation for expensive black-box functions
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
- A distributed methodology for approximate uniform global minimum sharing
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization
- A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW)
- Distributed convex optimization algorithms and their application to distributed control in peer-to-peer data storage system
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- Reprint of ``A distributed algorithm for efficiently solving linear equations and its applications (Special issue JCW)
- A distributed simultaneous perturbation approach for large-scale dynamic optimization problems
- Primal-dual algorithm for distributed constrained optimization
- Decentralized gradient algorithm for solution of a linear equation
- Asymptotic properties of primal-dual algorithm for distributed stochastic optimization over random networks with imperfect communications
- GADMM: fast and communication efficient framework for distributed machine learning
- Distributed optimisation for resource allocation with event-triggered communication over general directed topology
- Distributed finite-time optimisation for multi-agent systems via event-triggered aperiodically intermittent communication
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
- A distributed ADMM-like method for resource sharing over time-varying networks
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches
- Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints
- A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function
- Distributed online bandit linear regressions with differential privacy
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Distributed optimization under edge agreements: a continuous-time algorithm
- Distributed robust optimization with coupled constraints via Tseng's splitting method
- Fixed-time consensus for multi-agent systems with objective optimization on directed detail-balanced networks
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
- Krasovskii and shifted passivity based output consensus
- Distributed fixed-time optimization for multi-agent systems over a directed network
- Fixed‐time distributed optimization for multi‐agent systems with external disturbances over directed networks
- Distributed primal-dual method on unbalanced digraphs with row stochasticity
- Gradient-free algorithms for distributed online convex optimization
- Distributed event-triggered algorithm for convex optimization with coupled constraints
- Distributed dual averaging algorithm for multi-agent optimization with coupled constraints.
- Performance optimization for discrete network localization
- Exponential convergence of a distributed divide-and-conquer algorithm for constrained convex optimization on networks
- Distributed prediction-correction algorithm for convex optimization with coupled constraints
- Fully distributed constrained optimization algorithm over unbalanced network and its application to smart grids
- An adaptive gain-based fixed-time distributed algorithm for constrained optimization problems
- Gradient-free distributed online optimization in networks
- Model predictive control: past, present, and future
This page was built for publication: Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983146)
