Decentralized multi-agent optimization based on a penalty method
From MaRDI portal
Recommendations
- Penalty-based method for decentralized optimization over time-varying graphs
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization
- Distributed decision-coupled constrained optimization via proximal-tracking
- An approximate penalty method with descent for convex optimization problems
Cites work
- An approximate penalty method with descent for convex optimization problems
- Application of the penalty method to nonstationary approximation of an optimization problem
- Communication-efficient algorithms for decentralized and stochastic optimization
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Distributed multi-agent optimization with state-dependent communication
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed Optimization Over Time-Varying Directed Graphs
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3852804 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 193878 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3545338 (Why is no real title available?)
- scientific article; zbMATH DE number 1034200 (Why is no real title available?)
- scientific article; zbMATH DE number 3233715 (Why is no real title available?)
- scientific article; zbMATH DE number 3301974 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3358260 (Why is no real title available?)
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The method of penalty functions in problems of high dimensionality
- The Relaxation Method for Linear Inequalities
- Theory of variational inequalities with applications to problems of flow through porous media
- Two-level iterative method for non-stationary mixed variational inequalities
Cited in
(11)- A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees
- A new decentralized approach of multiagent cooperative pursuit based on the iterated elimination of dominated strategies model
- A decentralized multi-objective optimization algorithm
- Penalty-based method for decentralized optimization over time-varying graphs
- DECENTRALIZED OPTIMIZATION VIA NASH BARGAINING
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- A decentralized heuristic for multiple-choice combinatorial optimization problems
- Operator splitting methods for decentralized optimization
- Vanishing price of decentralization in large coordinative nonconvex optimization
- On the gradient method for solving multi-agent systems
- Decentralized Multi-Agent Optimization Based on a Penalty Method
This page was built for publication: Decentralized multi-agent optimization based on a penalty method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055302)
