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 solving some nonlinear elliptic boundary value problems.

• Type: Journal
• Year: 2002
• Where: MOC
• Authors: Xue-Cheng Tai, Jinchao Xu
• Keywords: Domain Decomposition Methods, MOC 2002, Unconstrained Convex Optimization, Uniform Convergence Estimates