Back to Search
Start Over
Rescaled Pure Greedy Algorithm for convex optimization.
- Source :
-
Calcolo . Jun2019, Vol. 56 Issue 2, pN.PAG-N.PAG. 1p. - Publication Year :
- 2019
-
Abstract
- We suggest a new greedy strategy for convex optimization in Banach spaces and prove its convergence rates under a suitable behavior of the modulus of uniform smoothness of the objective function. We show that this algorithm is a generalization of the recently discovered Rescaled Pure Greedy Algorithm for approximation in Hilbert spaces. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00080624
- Volume :
- 56
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Calcolo
- Publication Type :
- Academic Journal
- Accession number :
- 136240281
- Full Text :
- https://doi.org/10.1007/s10092-019-0311-x