Convergence rate analysis of an asynchronous space decomposition method for convex minimization

• Main Authors: Tai, Xue Cheng, Tseng, Paul
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2009
• Subjects: DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis
• Online Access: https://hdl.handle.net/10356/90754; http://hdl.handle.net/10220/6054; http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:ELSEVIER_SCOPUS&id=doi:&genre=&isbn=&issn=&date=2002&volume=71&issue=239&spage=1105&epage=1135&aulast=Tai&aufirst=%20X%20%2DC&auinit=&title=Mathematics%20of%20Computation&atitle=Convergence%20rate%20analysis%20of%20an%20asynchronous%20space%20decomposition%20method%20for%20convex%20minimization&sici.
• Institution: Nanyang Technological University

We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as special cases parallel domain decomposition methods and multigrid methods for solving elliptic partial differential equations. In particular, the method generalizes the additive Schwarz domain decomposition methods to allow for asynchronous updates. It also generalizes the BPX multigrid method to allow for use as solvers instead of as preconditioners, possibly with asynchronous updates, and is applicable to nonlinear problems. Applications to an overlapping domain decomposition for obstacle problems are also studied. The method of this work is also closely related to relaxation methods for nonlinear network flow. Accordingly, we specialize our convergence rate results to the above methods. The asynchronous method is implementable in a multiprocessor system, allowing for communication and computation delays among the processors.