An optimal gradient method for smooth strongly convex minimization (Q6038652): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5204822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact information-based complexity of smooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the oracle complexity of smooth strongly convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient first-order methods for convex minimization: a constructive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of first-order methods for smooth convex minimization: a novel approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal method for stochastic composite optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized first-order methods for smooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence analysis of the optimized gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based complexity of linear operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth strongly convex interpolation and exact worst-case performance of first-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4999082 / rank
 
Normal rank

Latest revision as of 00:55, 1 August 2024

scientific article; zbMATH DE number 7681261
Language Label Description Also known as
English
An optimal gradient method for smooth strongly convex minimization
scientific article; zbMATH DE number 7681261

    Statements

    An optimal gradient method for smooth strongly convex minimization (English)
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    worst-case bound
    0 references
    constructive recipe
    0 references

    Identifiers