Convergence rate analysis of an asynchronous space decomposition method for convex Minimization (Q4529709)
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: Convergence rate analysis of an asynchronous space decomposition method for convex Minimization |
scientific article; zbMATH DE number 1738028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence rate analysis of an asynchronous space decomposition method for convex Minimization |
scientific article; zbMATH DE number 1738028 |
Statements
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization (English)
0 references
6 May 2002
0 references
convex minimization
0 references
space decomposition
0 references
convergence rate
0 references
domain decomposition
0 references
multigrid
0 references
obstacle problem
0 references
Banach space
0 references
relaxation methods
0 references
nonlinear network flow
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.90702057
0 references
0.9010177
0 references
0.89514744
0 references
0.89318675
0 references
0.8909766
0 references
0.8820108
0 references
0.8820108
0 references
0.8803652
0 references
0.87961596
0 references
