Convergence analysis of the fast subspace descent method for convex optimization problems (Q5113667)
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 analysis of the fast subspace descent method for convex optimization problems |
scientific article; zbMATH DE number 7212231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence analysis of the fast subspace descent method for convex optimization problems |
scientific article; zbMATH DE number 7212231 |
Statements
Convergence analysis of the Fast Subspace Descent method for convex optimization problems (English)
0 references
15 June 2020
0 references
nonlinear PDE
0 references
full approximation storage (FAS) scheme
0 references
nonlineare multigrid method
0 references
convex optimization problems
0 references
fast subspace descent method
0 references
convergence analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.795176088809967
0 references
0.7935853600502014
0 references
0.7757456302642822
0 references
0.7428835034370422
0 references
