Return to search

Greedy Strategies for Convex Minimization

We have investigated two greedy strategies for finding an approximation to the minimum of a convex function E, defined on a Hilbert space H. We have proved convergence rates for a modification of the orthogonal matching pursuit and its weak version under suitable conditions on the objective function E. These conditions involve the behavior of the moduli of smoothness and the modulus of uniform convexity of E.

Identiferoai:union.ndltd.org:tamu.edu/oai:repository.tamu.edu:1969.1/151372
Date16 December 2013
CreatorsNguyen, Hao Thanh
ContributorsPetrova, Guergana, DeVore, Ronald, Schlumprecht, Thomas, Tsvetkov, Pavel
Source SetsTexas A and M University
LanguageEnglish
Detected LanguageEnglish
TypeThesis, text
Formatapplication/pdf

Page generated in 0.0143 seconds