http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
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. The electronic version of this dissertation is accessible from http://hdl.handle.net/1969.1/151372
Doctor of Philosophy Texas A & M University 2013 http://hdl.handle.net/1969.1/151372