A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
-
- Yamakawa Eiki
- College of Business Administration, Takamatsu University
-
- Fukusima Masao
- Kyoto University
この論文をさがす
説明
For a large-scale quadratic programming problem with separable objective function, a variant of the conjugate gradient method can effectively be applied to the dual problem. In this paper, we consider a block-parallel modification of the conjugate gradient method, which is suitable for implementation on a parallel computer. More precisely, the method proceeds in a block Jacobi manner and executes the conjugate gradient iteration to solve quadratic programming subproblems associated with respective blocks. We implement the method on a Connection Machine Model CM-5 in the Single-Program Multiple-Data model of computation. We report some numerical results, which show that the proposed method is effective particularly for problems with some block structure.
収録刊行物
-
- 日本オペレーションズ・リサーチ学会論文誌
-
日本オペレーションズ・リサーチ学会論文誌 39 (3), 407-427, 1996
公益社団法人 日本オペレーションズ・リサーチ学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001204109079040
-
- NII論文ID
- 110001184459
-
- NII書誌ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可