One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1007/s10092-019-0311-x
Copy DOI
Export
Save
Share
Cite Journal: Calcolo |  Publication Date: Apr 8, 2019 |
 Citations: 6 |
Affiliation: North Carolina State University, Texas A&M University
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.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
