Primal–dual accelerated gradient methods with small-dimensional relaxation oracle (Q5085262): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1809.05895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent / 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: A fast dual proximal gradient algorithm for convex minimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints / 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: Efficient first-order methods for convex minimization: a constructive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable alternative to Sinkhorn's algorithm for regularized optimal transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated gradient methods for nonconvex nonlinear and stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized uniformly optimal methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal modification of the linear coupling method / rank
 
Normal rank
Property / cites work
 
Property / cites work: New limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing the Optimized Gradient Method for Smooth Convex Minimization / 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: Q3967358 / 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank

Latest revision as of 10:43, 29 July 2024

scientific article; zbMATH DE number 7548205
Language Label Description Also known as
English
Primal–dual accelerated gradient methods with small-dimensional relaxation oracle
scientific article; zbMATH DE number 7548205

    Statements

    Primal–dual accelerated gradient methods with small-dimensional relaxation oracle (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2022
    0 references
    accelerated gradient descent
    0 references
    line-search
    0 references
    primal-dual methods
    0 references
    convex optimization
    0 references
    nonconvex optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers