MASSIVELY-PARALLEL SOLUTION OF QUADRATIC PROGRAMS VIA SUCCESSIVE OVERRELAXATION

被引：4

作者：

DELEONE, R ^{[1
]}

ROTH, MAT ^{[1
]}

机构：

[1] UNIV WISCONSIN,DEPT COMP SCI,CTR PARALLEL OPTIMIZAT,MADISON,WI 53706

来源：

CONCURRENCY-PRACTICE AND EXPERIENCE | 1993年 / 5卷 / 08期

关键词：

D O I：

10.1002/cpe.4330050802

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Serial and parallel successive overrelaxation (SOR) solutions or specially structured large-scale quadratic programs with simple bounds are discussed. By taking advantage of the sparsity structure or the problem, the SOR algorithm was successfully implemented on two massively parallel Single-Instruction-Multiple-Data machines: a Connection Machine CM-2 and a MasPar MP-1. Computational results for the well known obstacle problems show the effectiveness of the algorithm. Problems with millions of variables have been solved in a few minutes on these massively parallel machines, and speed-ups of 90% or more were achieved.

引用

页码：623 / 634

页数：12

共 31 条

[1] Cimatti G., 1978, Calcolo, V15, P249, DOI 10.1007/BF02575916
[2] CIMATTI G, 1977, APPL MATH OPT, V3, P227
[3] De Leone R., 1990, Annals of Operations Research, V22, P43, DOI 10.1007/BF02023047
[4] De Leone R., 1988, Optimization, Parallel Processing and Applications. Proceedings of the Oberwolfach Conference on Operations Research and the Workshop on Advanced Computation Techniques, Parallel Processing and Optimization, P103
[5] ASYNCHRONOUS PARALLEL SUCCESSIVE OVERRELAXATION FOR THE SYMMETRIC LINEAR COMPLEMENTARITY-PROBLEM
DELEONE, R
MANGASARIAN, OL
[J]. MATHEMATICAL PROGRAMMING, 1988, 42 (02) : 347 - 361
[6] DELEONE R, 1992, COAL B, P20
[7] DEMBO RS, 1983, 71 YAL U SCH ORG M B
[8] Duff I. S., 1989, DIRECT METHODS SPARS
[9] Gill P. E., 1981, PRACTICAL OPTIMIZATI
[10] HAN C, 1991, CS9104 PENNS STAT U

← 1 2 3 4 →