Dictionary descent in optimization (Q519963): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:31, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dictionary descent in optimization |
scientific article |
Statements
Dictionary descent in optimization (English)
0 references
31 March 2017
0 references
The author studies a problem of convex optimization. He shows that with the algorithms studied utilize dictionaries instead of a canonical basis used in the coordinate descent algorithms. Also, this approach allows him to reduce the dimensionality of the problem. An interesting theoretical study about this process is given.
0 references
sparse
0 references
optimization
0 references
greedy
0 references
Banach space
0 references
convergence rate
0 references
