mirage

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

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

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

Show full item record

Title: Global and uniform convergence of subspace correction methods for some convex optimization problems.
Author: Tai, Xue Cheng.; Xu, Jinchao.
Copyright year: 2002.
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
School: School of Physical and Mathematical Sciences
Rights: Mathematics of Computation © copyright 2002 American Mathematical Society. The journal's website is located at www.ams.org/mcom/.
Version: Published version

Files in this item

Files Size Format View
Tai-Xu-01.pdf 308.4Kb PDF View/Open
   

SFX Query

- Get published version (via NTU subscribed resources)
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
Global and uniform convergence of subspace correction methods for some convex optimization problems. 192

Total downloads

All Bitstreams Views
Tai-Xu-01.pdf 117

Top country downloads

Country Code Views
United States of America 44
China 27
Singapore 17
Germany 7
Russian Federation 5

Top city downloads

city Views
Mountain View 42
Singapore 17
Beijing 16
Alsbach-hähnlein 3
Bonn 2

Downloads / month

  2013-03 2013-04 2013-05 total
Tai-Xu-01.pdf 0 0 4 4