An asynchronous block-parallel algorithm for separable quadratic programming problems

An asynchronous block-parallel algorithm for separable quadratic programming problems

0.00 Avg rating0 Votes
Article ID: iaor19981969
Country: Japan
Volume: 10
Issue: 5
Start Page Number: 248
End Page Number: 258
Publication Date: May 1997
Journal: Transactions of the Institute of Systems, Control and Information Engineers
Authors: , ,
Keywords: networks
Abstract:

An asynchronous modification of the block-parallel algorithm is presented for quadratic programming problems with separable objective functions. In particular, an implementation strategy is proposed to effectively decentralize the communication overhead associated with a specific processor of a parallel computer. Through extensive numerical experiments on the Connection Machine Model CM-5, the efficiency of the proposed method is examined for large-scale problems with some block structure.

Reviews

Required fields are marked *. Your email address will not be published.