Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions
From MaRDI portal
Publication:6630989
DOI10.1007/s11768-023-00181-8MaRDI QIDQ6630989
Kaihong Lu, Cheng Li, Xiaoxi Yan, Hang Xu
Publication date: 31 October 2024
Published in: Control Theory and Technology (Search for Journal in Brave)
multi-agent systempseudoconvex optimizationonline distributed optimizationrandom gradient-free method
Cites Work
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
- Distributed ergodic algorithms for mixed equilibrium problems: absent of cut property
- Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- Random gradient-free minimization of convex functions
- Online Distributed Convex Optimization on Dynamic Networks
- Iterative methods for variational and complementarity problems
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- A Saddle Point Algorithm for Networked Online Convex Optimization
- Distributed optimal energy consumption control of HEVs under MFG-based speed consensus
- ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
- Distributed Zero-Order Algorithms for Nonconvex Multiagent Optimization
- Pseudomonotone variational inequalities: convergence of the auxiliary problem method
- Online Distributed Optimization With Nonconvex Objective Functions via Dynamic Regrets
- Distributed online optimization in time-varying unbalanced networks without explicit subgradients
This page was built for publication: Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions