Global and uniform convergence of subspace correction methods for some convex optimization problems
Tai, Xue Cheng
Date of Issue2002
School of Physical and Mathematical Sciences
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.
DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis
Mathematics of computation
Mathematics of Computation © copyright 2002 American Mathematical Society. The journal's website is located at www.ams.org/mcom/.