Global and uniform convergence of subspace correction methods for some convex optimization problems
Author
Tai, Xue Cheng
Xu, Jinchao
Date of Issue
2002School
School of Physical and Mathematical Sciences
Version
Published version
Abstract
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.
Subject
DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis
Type
Journal Article
Series/Journal Title
Mathematics of computation
Rights
Mathematics of Computation © copyright 2002 American Mathematical Society. The journal's website is located at www.ams.org/mcom/.
Collections
http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:ELSEVIER_SCOPUS&id=doi:&genre=&isbn=&issn=&date=2002&volume=71&issue=237&spage=105&epage=124&aulast=Tai&aufirst=%20X%20%2DC&auinit=&title=Mathematics%20of%20Computation&atitle=Global%20and%20uniform%20convergence%20of%20subspace%20correction%20methods%20for%20some%20convex%20optimization%20problems&sici.
Get published version (via NTU subscribed resources)
http://dx.doi.org/10.1090/S0025-5718-01-01311-4.
Get published version (via Digital Object Identifier)