A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
From MaRDI portal
Publication:6069332
DOI10.1002/rnc.6266zbMath1528.93015arXiv2104.10971OpenAlexW3154894049MaRDI QIDQ6069332
Publication date: 16 December 2023
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.10971
Cites Work
- Average consensus on general strongly connected digraphs
- Gradient-free method for nonsmooth distributed optimization
- Random gradient-free minimization of convex functions
- Random optimization
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Differentially Private Distributed Constrained Optimization
- Online Distributed Convex Optimization on Dynamic Networks
- Distributed Optimization Over Time-Varying Directed Graphs
- Differentially Private Distributed Convex Optimization via Functional Perturbation
- Distributed Robust Multicell Coordinated Beamforming With Imperfect CSI: An ADMM Approach
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
- Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
- Strong consistency of random gradient‐free algorithms for distributed optimization
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
- Distributed Time-Varying Quadratic Optimization for Multiple Agents Under Undirected Graphs
This page was built for publication: A gradient‐free distributed optimization method for convex sum of nonconvex cost functions