mirage

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

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

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

Show simple item record

dc.contributor.author Tai, Xue Cheng.
dc.contributor.author Tseng, Paul.
dc.date.accessioned 2009-08-12T02:54:16Z
dc.date.available 2009-08-12T02:54:16Z
dc.date.copyright 2001
dc.date.issued 2009-08-12T02:54:16Z
dc.identifier.citation Tai, X. C., & Tseng, P. (2001). Convergence rate analysis of an asynchronous space decomposition method for convex minimization. Mathematics of Computation, 71(239), 1105-1135.
dc.identifier.issn 0025-5718
dc.identifier.uri http://hdl.handle.net/10220/6054
dc.description.abstract 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.
dc.format.extent 31 p.
dc.language.iso en
dc.relation.ispartofseries Mathematics of Computation.
dc.rights Mathematics of Computation © copyright 2001 American Mathematical Society. The journal's website is located at http://www.ams.org/mcom/.
dc.subject DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis.
dc.title Convergence rate analysis of an asynchronous space decomposition method for convex minimization.
dc.type Journal Article
dc.contributor.school School of Physical and Mathematical Sciences
dc.identifier.openurl 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.
dc.identifier.doi http://dx.doi.org/10.1090/S0025-5718-01-01344-8.
dc.description.version Published version

Files in this item

Files Size Format View
Tai-Tseng-CRA-02.pdf 452.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Convergence rate analysis of an asynchronous space decomposition method for convex minimization. 300

Total downloads

All Bitstreams Views
Tai-Tseng-CRA-02.pdf 159

Top country downloads

Country Code Views
United States of America 68
China 41
Singapore 19
Russian Federation 12
Japan 5

Top city downloads

city Views
Mountain View 56
Beijing 29
Singapore 19
Denver 6
Southampton 2

Downloads / month

  2014-02 2014-03 2014-04 total
Tai-Tseng-CRA-02.pdf 0 0 6 6