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

  • Authors:
  • Xue-Cheng Tai;Jinchao Xu

  • Affiliations:
  • Department of Mathematics, University of Bergen, Johannes Brunsgate 12, 5007, Bergen, Norway;Center for Computational Mathematics and Applications and Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania

  • Venue:
  • Mathematics of Computation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.