Trends in Consensus-Based Optimization
نویسندگان
چکیده
In this chapter we give an overview of the consensus-based global optimization algorithm and its recent variants. We recall formulation analytical results original model, then discuss variants using component-wise independent or common noise. combination with mini-batch approaches those were tailored for machine learning applications. Moreover, it turns out that estimates are dimension independent, which is useful high-dimensional problems. relationship particle swarm optimization, a method widely used in engineering community. Then survey variant proposed problems constrained to hyper-surfaces. conclude remarks on applications, preprints open
منابع مشابه
A non-consensus based distributed optimization algorithm
In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization costs that are expressed as sums of functions, where each function is associated to an agent. The algorithm can be applied to continuously differentiable cost functions, it is not consensu...
متن کاملCommunication/Computation Tradeoffs in Consensus-Based Distributed Optimization
We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free? Central to our analysis is a problem-specific value r which quantifies the communication/computation tradeoff. We show that organizing the communication among nod...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملConsensus Optimization on Manifolds
The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e. max...
متن کاملA performance comparison between two consensus-based distributed optimization algorithms
In this paper we address the problem of multi-agent optimization for convex functions expressible as sums of convex functions. Each agent has access to only one function in the sum and can use only local information to update its current estimate of the optimal solution. We consider two consensus-based iterative algorithms, based on a combination between a consensus step and a subgradient decen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and simulation in science, engineering & technology
سال: 2021
ISSN: ['2164-3725', '2164-3679']
DOI: https://doi.org/10.1007/978-3-030-93302-9_6