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

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

Full description

Bibliographic Details
Main Authors: Tai, Xue Cheng, Xu, Jinchao
Other Authors: School of Physical and Mathematical Sciences
Format: Journal Article
Language:English
Published: 2009
Subjects:
Online Access: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.
_version_ 1826114679625220096
author Tai, Xue Cheng
Xu, Jinchao
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Tai, Xue Cheng
Xu, Jinchao
author_sort Tai, Xue Cheng
collection NTU
description 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.
first_indexed 2024-10-01T03:43:04Z
format Journal Article
id ntu-10356/91639
institution Nanyang Technological University
language English
last_indexed 2024-10-01T03:43:04Z
publishDate 2009
record_format dspace
spelling ntu-10356/916392023-02-28T19:37:52Z Global and uniform convergence of subspace correction methods for some convex optimization problems Tai, Xue Cheng Xu, Jinchao School of Physical and Mathematical Sciences DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis 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. Published version 2009-08-12T06:52:46Z 2019-12-06T18:09:24Z 2009-08-12T06:52:46Z 2019-12-06T18:09:24Z 2002 2002 Journal Article Tai, X. C., & Xu, J. (2002). Global and uniform convergence of subspace correction methods for some convex optimization problems. Mathematics of Computation, 71(237), 105-124. 0025-5718 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. 10.1090/S0025-5718-01-01311-4. en Mathematics of computation Mathematics of Computation © copyright 2002 American Mathematical Society. The journal's website is located at www.ams.org/mcom/. 20 p. application/pdf
spellingShingle DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis
Tai, Xue Cheng
Xu, Jinchao
Global and uniform convergence of subspace correction methods for some convex optimization problems
title Global and uniform convergence of subspace correction methods for some convex optimization problems
title_full Global and uniform convergence of subspace correction methods for some convex optimization problems
title_fullStr Global and uniform convergence of subspace correction methods for some convex optimization problems
title_full_unstemmed Global and uniform convergence of subspace correction methods for some convex optimization problems
title_short Global and uniform convergence of subspace correction methods for some convex optimization problems
title_sort global and uniform convergence of subspace correction methods for some convex optimization problems
topic DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis
url 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.
work_keys_str_mv AT taixuecheng globalanduniformconvergenceofsubspacecorrectionmethodsforsomeconvexoptimizationproblems
AT xujinchao globalanduniformconvergenceofsubspacecorrectionmethodsforsomeconvexoptimizationproblems