Distributed Nonconvex Optimization of Multiagent Systems Using Boosting Functions to Escape Local Optima
From MaRDI portal
Recommendations
- Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
- Distributed optimization via multi-agent systems
- Distributed Optimization of Nonlinear Multiagent Systems: A Small-Gain Approach
- Distributed Zero-Order Algorithms for Nonconvex Multiagent Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Coupled Multiagent Stochastic Optimization
- Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
- Distributed Time-Varying Convex Optimization for a Class of Nonlinear Multiagent Systems
- A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Cited in
(5)- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
- Sectorial coverage control with load balancing in non-convex hollow environments
- An event-triggered collaborative neurodynamic approach to distributed global optimization
- Two-timescale projection neural networks in collaborative neurodynamic approaches to global optimization and distributed optimization
- Diffeomorphic coverage control in non-convex annulus region with conformal mapping
This page was built for publication: Distributed Nonconvex Optimization of Multiagent Systems Using Boosting Functions to Escape Local Optima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033811)
