Greedy Strategies for Convex Minimization
MetadataShow full item record
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.
Nguyen, Hao Thanh (2013). Greedy Strategies for Convex Minimization. Doctoral dissertation, Texas A & M University. Available electronically from