Distributed projection‐free algorithm for constrained aggregative optimization
From MaRDI portal
Abstract: In this paper, we focus on solving a distributed convex aggregative optimization problem in a network, where each agent has its own cost function which depends not only on its own decision variables but also on the aggregated function of all agents' decision variables. The decision variable is constrained within a feasible set. In order to minimize the sum of the cost functions when each agent only knows its local cost function, we propose a distributed Frank-Wolfe algorithm based on gradient tracking for the aggregative optimization problem where each node maintains two estimates, namely an estimate of the sum of agents' decision variable and an estimate of the gradient of global function. The algorithm is projection-free, but only involves solving a linear optimization to get a search direction at each step. We show the convergence of the proposed algorithm for convex and smooth objective functions over a time-varying network. Finally, we demonstrate the convergence and computational efficiency of the proposed algorithm via numerical simulations.
Recommendations
- Primal-dual algorithm for distributed constrained optimization
- Momentum-based distributed gradient tracking algorithms for distributed aggregative optimization over unbalanced directed graphs
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
Cites work
- Consensus-based distributed fixed-time optimization for a class of resource allocation problems
- Decentralized Frank–Wolfe Algorithm for Convex and Nonconvex Problems
- Distributed Aggregative Optimization Over Multi-Agent Networks
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed Newton's Method for Network Cost Minimization
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed aggregative optimization with quantized communication
- Distributed algorithms for aggregative games on graphs
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Distributed optimization with information-constrained population dynamics
- Distributed stochastic gradient tracking methods
- Distributed stochastic subgradient projection algorithms for convex optimization
- Dual Averaging Push for Distributed Convex Optimization Over Time-Varying Directed Graph
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Optimal distributed stochastic mirror descent for strongly convex optimization
- Primal-dual algorithm for distributed constrained optimization
Cited in
(7)- Nonconvex distributed feedback optimization for aggregative cooperative robotics
- Distributed aggregative optimization over directed networks with column-stochasticity
- Distributed aggregative optimization with affine coupling constraints
- Nabla fractional distributed aggregative optimization algorithm
- A compressed gradient tracking method for distributed aggregative optimization
- Differentially private distributed online aggregative game with time-varying constraints
- Momentum-based distributed gradient tracking algorithms for distributed aggregative optimization over unbalanced directed graphs
This page was built for publication: Distributed projection‐free algorithm for constrained aggregative optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6193171)
