Parallel Synchronous and Asynchronous Space-Decomposition Algorithms for Large-Scale Minimization Problems

  • Authors:

  • Chin-Sung Liu;Ching-Huan Tseng

  • Affiliations:

  • Applied Optimum Design Laboratory, Department of Mechanical Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan, ROC;Applied Optimum Design Laboratory, Department of Mechanical Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan, ROC. chtseng@cc.nctu.edu.tw

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.