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 functio...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/151372 |