Dictionary descent in optimization (Q519963): Difference between revisions

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.