Multicoordination methods for solving convex block-angular programs

Citation
Rr. Meyer et G. Zakeri, Multicoordination methods for solving convex block-angular programs, SIAM J OPTI, 10(1), 1999, pp. 121-131
Citations number
16
Categorie Soggetti
Mathematics
Journal title
SIAM JOURNAL ON OPTIMIZATION
ISSN journal
10526234 → ACNP
Volume
10
Issue
1
Year of publication
1999
Pages
121 - 131
Database
ISI
SICI code
1052-6234(19991129)10:1<121:MMFSCB>2.0.ZU;2-C
Abstract
Several decomposition methods are considered for solving block-angular prog rams (BAPs) in parallel. We present a computational comparison of synchrono us multicoordination methods. The most efficient of these approaches is sho wn to involve an intermediate number of blocks in the coordination phase.