检索结果-内蒙古大学图书馆

asynchronous multisplitting methods for nonlinear fixed point problems

NUMERICAL algorithms 1997年第3-4期15卷 315-345页

作者： Bahi, J Miellou, JC Rhofir, K IUT Belfort Montbeliard UMR 6623 Lab Calcul Sci Besancon F-90016 Belfort France Lab Calcul Sci Besancon UMR 6623 F-25030 Besancon France

Our aim is to present for nonlinear problems asynchronous multisplitting algorithms including both the basic situation of O'Leary and White and the discrete analogue of Schwarz's alternating method and its multisubdomain extensions and moreover their two-stage counterparts. The analysis of these methods is based on El Tarazi's convergence theorem for asynchronous iterations and leads to a good level of asynchronism in each of the considered situations.

关键词： asynchronous algorithms multisplitting methods nonlinear problems

来源：评论

学校读者我要写书评

暂无评论

asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability

Asynchronous Evolutionary Algorithm for Finding Backdoors in...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Pavlenko, Artem Chivilikhin, Daniil Semenov, Alexander ITMO Univ St Petersburg Russia

ISBN: (数字)9781665467087

ISBN: (纸本)9781665467087

In this work we propose an asynchronous parallel evolutionary algorithm that is efficient for a specific type of gray-box optimization problems, in which the calculation of the fitness function may be split into a set of several independent calculations. An example of such an optimization problem is the search for backdoors (hidden structures) in the Boolean satisfiability problem: subsets of variables that allow an efficient splitting of the problem into a set of independent subproblems. Our experiments show that the proposed asynchronous approach allows speeding up the algorithm considerably, while also efficiently utilizing computing cluster time.

关键词： evolutionary algorithms asynchronous algorithms Boolean satisfiability problem optimization

来源：评论

学校读者我要写书评

暂无评论

Revisiting asynchronous Linear Solvers: Provable Convergence Rate Through Randomization

Revisiting Asynchronous Linear Solvers: Provable Convergence...

引用

IEEE 28th International Parallel & Distributed Processing Symposium (IPDPS)

作者： Avron, H. Druinsky, A. Gupta, A. IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA Tel Aviv Univ Ramat Aviv Israel IBM Corp TJ Watson Res Ctr New York NY 10001 USA

ISBN: (纸本)9780769552071

asynchronous methods for solving systems of linear equations have been researched since Chazan and Miranker's pioneering 1969 paper. The underlying idea of asynchronous methods is to avoid processor idle time by allowing the processors to continue to make progress even if not all progress made by other processors has been communicated to them. Historically, work on asynchronous methods for solving linear equations focused on proving convergence in the limit. Comparison of the asynchronous convergence rate with its synchronous counterpart and its scaling with the number of processors were seldom studied, and are still not well understood. Furthermore, the applicability of these methods was limited to restricted classes of matrices, such as diagonally dominant matrices. We propose a randomized shared-memory asynchronous method for general symmetric positive definite matrices. We rigorously analyze the convergence rate and prove that it is linear, and is close to that of the method's synchronous counterpart if the processor count is not excessive relative to the size and sparsity of the matrix. Our work presents a significant improvement in convergence analysis as well as in the applicability of asynchronous linear solvers, and suggests randomization as a key paradigm to serve as a foundation for asynchronous methods.

关键词： asynchronous algorithms iterative linear solvers shared memory asynchronous shared memory PROCESSOR Converge Randomisation Linear equation Solvers matrices

来源：评论

学校读者我要写书评

暂无评论

asynchronous Consensus Protocols for Multi-Agent Systems

Asynchronous Consensus Protocols for Multi-Agent Systems

引用

IEEE International Conference on Automation and Logistics

作者： Li, Qin Jiang, Zhong-Ping NYU Dept Elect & Comp Engn Polytech Inst Brooklyn NY 11201 USA

ISBN: (纸本)9781424447947

Motivated by the famous Vicsek's model, this paper addresses the problem of heading consensus for a multi-agent group by using asynchronous decentralized algorithms. Two algorithms, one for the leaderless case and one for the leader based case are proposed. The appealing feature of both algorithms is that neither a global coordinate system nor a common clock is required. It is proved that these algorithms guarantee (almost) global consensus of the headings under some well known connectivity assumptions.

关键词： Multi-agent systems consensus decentralized coordination asynchronous algorithms

来源：评论

学校读者我要写书评

暂无评论

Average Consensus with asynchronous Updates and Unreliable Communication

Average Consensus with Asynchronous Updates and Unreliable C...

引用

20th World Congress of the International-Federation-of-Automatic-Control (IFAC)

作者： Bof, Nicoletta Carli, Ruggero Schenato, Luca Univ Padua Dept Informat Engn Via Gradenigo 6-A I-35131 Padua Italy

In this work we introduce an algorithm for distributed average consensus which is able to deal with asynchronous and unreliable communication systems. It is inspired by two algorithms for average consensus already present in the literature, one which deals with asynchronous but reliable communication and the other which deals with unreliable but synchronous communication. We show that the proposed algorithm is exponentially convergent under mild assumptions regarding the nodes update frequency and the link failures. The theoretical results are complemented with numerical simulations. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Multi-agent systems Distributed control and estimation Control and estimation with data loss asynchronous algorithms Average consensus

来源：评论

学校读者我要写书评

暂无评论

Average Consensus with asynchronous Updates and Unreliable Communication

引用

IFAC-PapersOnLine 2017年第1期50卷 601-606页

作者： Bof N. Carli R. Schenato L. All authors are with the Department of Information Engineering University of Padova Via Gradenigo 6/a Padova 35131 Italy

关键词： asynchronous algorithms Average consensus Control Distributed control estimation estimation with data loss Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

ESSENTIALLY CYCLIC asynchronous NONCONVEX LARGE-SCALE OPTIMIZATION 18

ESSENTIALLY CYCLIC ASYNCHRONOUS NONCONVEX LARGE-SCALE OPTIMI...

引用

18th IEEE International Workshop on Signal Processing Advances for Wireless Communications (SPAWC)

作者： Cannelli, L. Facchinei, F. Kungurtsev, V. Scutari, G. Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA Univ Roma La Sapienza Dept Comp Control & Management Engn Rome Italy Czech Tech Univ Agent Technol Ctr Prague Czech Republic

ISBN: (纸本)9781509030095

We propose a novel parallel essentially cyclic asynchronous algorithm for the minimization of the sum of a smooth (nonconvex) function and a convex (nonsmooth) regularizer. The framework hinges on Successive Convex Approximation (SCA) techniques and on a new global model that describes many asynchronous environments in a more faithful and exhaustive way with respect to state-of-the-art models. A key feature of the model is the update of (block) variables according to the essential cyclic rule: an integer B exists such that, every B iterations, all (block) variables are updated at least once. The algorithm is theoretically guaranteed to achieve a sublinear convergence rate and near linear speedup with respect to the number of cores. Asymptotic convergence to stationary solutions is also proved. Numerical results show that our scheme compares favorably to existing asynchronous methods.

关键词： asynchronous algorithms big-data inconsistent read nonconvex constrained optimization linear speedup

来源：评论

学校读者我要写书评

暂无评论

asynchronous Consensus in Synchronous Systems Using send_to_all Primitive

引用

SN Computer Science 2023年第6期4卷 784页

作者： Srinivasan, Sathyanarayanan Ramesh, Kandukoori Shiv Nadar University Chennai India National Institute of Technology Warangal India

Consensus is a fundamental agreement problem that arises when a set of distributed processes has to decide on a common value among their respective proposals. An asynchronous consensus algorithm is capable of preserving the safety property of consensus when the system is asynchronous and can solve consensus when the system is synchronous. Such algorithms are practical as modern distributed systems often experience some transient periods of asynchrony and it is essential that the system is safe during such periods. In this work, we consider systems that are capable of performing a broadcast operation in a single atomic step. Such systems can bypass the f+ 1 lower bound for achieving consensus in synchronous runs and allow consensus to be achieved in constant time by tolerating up to f failures. We construct an asynchronous consensus algorithm for such systems that tolerate up-to f=⌈n2-1⌉ process failures, where n is the size of the system. In synchronous runs of the system where δ is the upper bound for message delivery, our algorithm achieves consensus in 9 δ time in synchronous runs and 14 δ time in partial synchronous runs. © 2023, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： asynchronous algorithms Consensus Fault tolerance send_to_all primitive

来源：评论

学校读者我要写书评

暂无评论

An asynchronous Implementation of the Limited Memory CMA-ES 14

An Asynchronous Implementation of the Limited Memory CMA-ES

引用

IEEE 14th International Conference on Machine Learning and Applications ICMLA

作者： Arkhipov, Viktor Buzdalov, Maxim Shalyto, Anatoly ITMO Univ 49 Kronverkskiy Prosp St Petersburg 197101 Russia

ISBN: (纸本)9781509002870

We present our asynchronous implementation of the LM-CMA-ES algorithm, which is a modern evolution strategy for solving complex large-scale continuous optimization problems. Our implementation brings the best results when the number of cores is relatively high and the computational complexity of the fitness function is also high. The experiments with benchmark functions show that it is able to overcome its origin on the Sphere function, reaches certain thresholds faster on the Rosenbrock and Ellipsoid function, and surprisingly performs much better than the original version on the Rastrigin function.

关键词： asynchronous algorithms CMA-ES Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

MULTI-AGENT asynchronous NONCONVEX LARGE-SCALE OPTIMIZATION 7

MULTI-AGENT ASYNCHRONOUS NONCONVEX LARGE-SCALE OPTIMIZATION

引用

7th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)

作者： Cannelli, L. Facchinei, F. Scutari, G. Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA Univ Roma La Sapienza Dept Comp Control & Management Engn Rome Italy

ISBN: (纸本)9781538612514

We propose a novel algorithmic framework for the asynchronous and distributed optimization of multi-agent systems. We consider the constrained minimization of a nonconvex and nonsmooth partially separable sum-utility function, i.e., the cost function of each agent depends on the optimization variables of that agent and of its neighbors. This partitioned setting arises in several applications of practical interest. The proposed algorithmic framework is distributed and asynchronous: i) agents update their variables at arbitrary times, without any coordination with the others;and ii) agents may use outdated information from their neighbors. Convergence to stationary solutions is proved, and theoretical complexity results are provided, showing nearly ideal linear speedup with respect to the number of agents, when the delays are not too large.

关键词： asynchronous algorithms big-data problems multi-agent nonconvex optimization linear speedup

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：