Greedy strategies for convex optimization (Q2363679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1401.1754 / rank
 
Normal rank

Revision as of 05:05, 19 April 2024

scientific article
Language Label Description Also known as
English
Greedy strategies for convex optimization
scientific article

    Statements

    Greedy strategies for convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2017
    0 references
    The paper considers two greedy procedures for solving the minimization of a convex function on a given Hilbert space. The first one is a convex minimization analogue of the orthogonal matching pursuit algorithm. The second is the weak Chebyshev greedy algorithm. The authors establish a priori convergence rates for both algorithms under certain conditions of uniform smoothness and uniform convexity.
    0 references
    greedy algorithms
    0 references
    convex optimization
    0 references
    rates of convergence
    0 references
    Hilbert space
    0 references
    orthogonal matching pursuit algorithm
    0 references

    Identifiers