Parallel computing in bound constrained quadratic programming

被引：0

作者：

D'Apuzzo, M ^{[1
]}

De Simone, V ^{[1
]}

Marino, M ^{[1
]}

Toraldo, G ^{[1
]}

机构：

[1] Univ Naples 2, Dpt Math, Caserta, Italy

来源：

NUMERICAL ANALYSIS: METHODS AND MATHEMATICAL SOFTWARE, SUPPLEMENT | 2000年 / 46卷

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We describe our research activity concerning the development of parallel software for numerical optimization. We present some design and computational experiences on the solution of convex bound constrained quadratic programming problems on high performance machines. We compare the projected gradient method with the potential reduction algorithm in order to develop an efficient parallel software.

引用

页码：479 / 491

页数：13

共 17 条

[1]

Anderson E., 1995, LAPACK USERS GUIDE

[2]

CHOI J, 1995, 100 LAPACK U TENN

[3]

Choi J., 1995, CS95283 UT

[4]

CHOI J, 1995, LAPACK USERS GUIDE

[5]

DAPUZZO M, UNPUB PARALLEL POTEN

[6]

DAPUZZO M, 1997, RICERCA OPERATIVA, V27, P125

[7]

DAPUZZO M, 1998, HIGH PERFORMANCE ALG, P125

[8]

DONGARRA JJ, 1995, CS95281 UT

[9] ON THE MAXIMIZATION OF A CONCAVE QUADRATIC FUNCTION WITH BOX CONSTRAINTS [J].

FRIEDLANDER, A ;

MARTINEZ, JM .

SIAM JOURNAL ON OPTIMIZATION, 1994, 4 (01) :177-192

[10]

Gill M., 1981, Practical Optimization

← 1 2 →