Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions

DOI10.1007/S11768-023-00181-8MaRDI QIDQ6630989zbMATH OpenFDO

Authors Xiaoxi Yan, Cheng Li, Kaihong Lu, Hang Xu

Publication date 31 October 2024

Published in Control Theory and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11768-023-00181-8

zbMATH Keywords

multi-agent systemonline distributed optimizationpseudoconvex optimizationrandom gradient-free method

Mathematics Subject Classification ID

Convex programming (90C25) Multi-agent systems (93A16)

Cites work

• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A Saddle Point Algorithm for Networked Online Convex Optimization
• Continuous-time distributed optimization with strictly pseudoconvex objective functions
• Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
• Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems
• Distributed ergodic algorithms for mixed equilibrium problems: absent of cut property
• Distributed Online Convex Optimization on Time-Varying Directed Graphs
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Distributed online optimization in time-varying unbalanced networks without explicit subgradients
• Distributed optimal energy consumption control of HEVs under MFG-based speed consensus
• Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
• Distributed Zero-Order Algorithms for Nonconvex Multiagent Optimization
• Iterative methods for variational and complementarity problems
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• Online Distributed Convex Optimization on Dynamic Networks
• Online Distributed Optimization With Nonconvex Objective Functions via Dynamic Regrets
• Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
• Pseudomonotone variational inequalities: convergence of the auxiliary problem method
• Random gradient-free minimization of convex functions
• Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
• ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks

This page was built for publication: Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6630989)