Global and uniform convergence of subspace correction methods for some convex optimization problems

• المؤلفون الرئيسيون: Tai, Xue Cheng, Xu, Jinchao
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2009
• الموضوعات: DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/91639; http://hdl.handle.net/10220/6068; 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.

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 so...