Multicoordination Methods for Solving Convex Block-Angular Programs

Multicoordination Methods for Solving Convex Block-Angular Programs

Several decomposition methods are considered for solving block-angular programs (BAPs) in parallel. We present a computational comparison of synchronous multicoordination methods. The most efficient of these approaches is shown to involve an intermediate number of blocks in the coordination phase.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on optimization 1999, Vol.10 (1), p.121-131
Hauptverfasser: Meyer, R. R., Zakeri, G.
Format: Artikel
Sprache:eng
Schlagworte:
Approximation
Decomposition
Variables
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Several decomposition methods are considered for solving block-angular programs (BAPs) in parallel. We present a computational comparison of synchronous multicoordination methods. The most efficient of these approaches is shown to involve an intermediate number of blocks in the coordination phase.
ISSN:1052-6234
1095-7189
DOI:10.1137/S1052623496313635