This paper considers decentralized minimization of N:=nm smooth nonconvex cost functions
equally divided over a directed network of n nodes. Specifically, we describe a stochastic …

In this paper, we consider a stochastic distributed nonconvex optimization problem with the
cost function being distributed over n agents having access only to zeroth-order (ZO) …

This article considers the distributed nonconvex optimization problem of minimizing a global
cost function formed by a sum of local cost functions by using local information exchange …

i= 1 fi (xi) st xi= xj. x∈ X(A1) where x=[x1, x2,..., xn]∈ Rnp, xi∈ Rp, fi: Rp→ R is a convex
function, X is the global constraint. First, we provide an assumption about the communication …

This paper addresses distributed constrained optimization problems involving strongly
convex global objective functions represented as the sum of individual convex objective …

We consider a multi-agent setting with agents exchanging information over a possibly time-
varying network, aiming at minimising a separable objective function subject to constraints …

This paper designs a distributed stochastic annealing algorithm for non-convex cooperative
aggregative games, whose agents' cost functions not only depend on agents' own decision …

Solving optimization problems in multiagent systems involves information exchange
between agents. The obtained solutions should be robust to information delays and errors …

This article is concerned with the distributed stochastic multiagent-constrained optimization
problem over a time-varying network with a class of communication noise. This article …

This paper proposes a novel distributed optimization algorithm with fractional order
dynamics to solve linear algebraic equations. Firstly, the authors proposed “Consensus+ …