Convergence of the dual greedy algorithm in Banach spaces (Q1019592)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5561318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of the dual greedy algorithm in Banach spaces |
scientific article; zbMATH DE number 5561318 |
Statements
Convergence of the dual greedy algorithm in Banach spaces (English)
0 references
3 June 2009
0 references
The authors discuss the convergence properties of the dual greedy algorithm for finding the minimum of a given convex function in a wide class of Banach spaces.
0 references
dual greedy algorithm
0 references
convex function
0 references
Banach space
0 references
tame function
0 references
0.9550023
0 references
0.9505616
0 references
0.9399525
0 references
0.9311124
0 references
0 references
0.9111461
0 references
0.90850437
0 references
0 references
0.9028903
0 references
