Global and uniform convergence of subspace correction methods for some convex optimization problems (Q2759087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Global and uniform convergence of subspace correction methods for some convex optimization problems |
scientific article; zbMATH DE number 1680742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global and uniform convergence of subspace correction methods for some convex optimization problems |
scientific article; zbMATH DE number 1680742 |
Statements
10 December 2001
0 references
multigrid
0 references
domain decomposition
0 references
nonlinear elliptic equation
0 references
space decomposition
0 references
convex optimization
0 references
convergence
0 references
subspace correction
0 references
0 references
0 references
Global and uniform convergence of subspace correction methods for some convex optimization problems (English)
0 references
This paper provides 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 of solving some nonlinear elliptic boundary value problems.
0 references
