Sciweavers

Share
MOC
2002

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

12 years 9 months ago
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.
Xue-Cheng Tai, Jinchao Xu
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where MOC
Authors Xue-Cheng Tai, Jinchao Xu
Comments (0)
books