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

共 50 条

[41] Inexact semimonotonic augmented lagrangians with optimal feasibility convergence for convex bound and equality constrained quadratic programming
Dostál, Z
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2005, 43 (01) : 96 - 115
[42] A branch and bound algorithm for quantified quadratic programming
F. Domes
A. Goldsztejn
Journal of Global Optimization, 2017, 68 : 1 - 22
[43] A branch and bound algorithm for quantified quadratic programming
Domes, F.
Goldsztejn, A.
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 68 (01) : 1 - 22
[44] A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
Zhu, Zhibin
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2008, 212 (01) : 112 - 125
[45] A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints
Gao, Yuelin
Li, Feifei
Jin, Siqiao
MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
[46] Duality bound method for the general quadratic programming problem with quadratic constraints
Thoai, NV
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (02) : 331 - 354
[47] Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints
N. V. Thoai
Journal of Optimization Theory and Applications, 2000, 107 : 331 - 354
[48] A new bound for the quadratic assignment problem based on convex quadratic programming
Kurt M. Anstreicher
Nathan W. Brixius
Mathematical Programming, 2001, 89 : 341 - 357
[49] A new bound for the quadratic assignment problem based on convex quadratic programming
Anstreicher, KM
Brixius, NW
MATHEMATICAL PROGRAMMING, 2001, 89 (03) : 341 - 357
[50] Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
Cheng Lu
Zhibin Deng
Wei-Qiang Zhang
Shu-Cherng Fang
Journal of Global Optimization, 2018, 70 : 171 - 187

← 1 2 3 4 5 →