On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617)

From MaRDI portal
Revision as of 12:44, 23 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59512949, #quickstatements; #temporary_batch_1727091737240)
scientific article
Language Label Description Also known as
English
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
scientific article

    Statements

    On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    gradient method
    0 references
    steepest descent
    0 references
    semidefinite programming
    0 references
    performance estimation problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references