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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 105-124 |
| Number of pages | 20 |
| Journal | Mathematics of Computation |
| Volume | 71 |
| Issue number | 237 |
| DOIs | |
| State | Published - 2002 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Global and uniform convergence of subspace correction methods for some convex optimization problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver