Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems
檔案
- 000089523600006.pdf (471.0 KB, Adobe PDF)
日期
2000-10-01
類型
系所
期刊名稱
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷期與頁次
第 17 卷第 1 期,頁 85–107
ISSN
0926-6003
語言
英文
摘要
Three parallel space-decomposition minimization (PSDM) algorithms, based on the parallel variable transformation (PVT) and the parallel gradient distribution (PGD) algorithms (O.L. Mangasarian, SIMA Journal on Control and Optimization, vol. 33, no. 6, pp. 1916-1925.), are presented for solving convex or nonconvex unconstrained minimization problems. The PSDM algorithms decompose the variable space into subspaces and distribute these decomposed subproblems among parallel processors. It is shown that if all decomposed subproblems are uncoupled of each other, they can be solved independently. Otherwise, the parallel algorithms presented in this paper can be used. Numerical experiments show that these parallel algorithms can save processor time, particularly for medium and large-scale problems. Up to six parallel processors are connected by Ethernet networks to solve four large-scale minimization problems. The results are compared with those obtained by using sequential algorithms run on a single processor. An application of the PSDM algorithms to the training of multilayer Adaptive Linear Neurons (Madaline) and a new parallel architecture for such parallel training are also presented.
關鍵詞
unconstrained minimizationparallel algorithmparallel trainingsynchronous algorithmasynchronous algorithmdecomposition method所屬典藏
期刊論文引用此條目
Liu, C., & Tseng, C. (2000). Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 17(1), 85–107. https://doi.org/10.1023/A:1008731209637
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30224