Exact gradient methods with memory

DOI10.1080/10556788.2022.2091559MaRDI QIDQ5058416zbMATH OpenOpenAlexFDO

Authors Mihai I. Florea

Publication date 20 December 2022

Published in Optimization Methods \& Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1080/10556788.2022.2091559

zbMATH Keywords

accelerationBregman distancebundlecomposite problemsgradient methodpiece-wise linear modelrelative smoothness

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Gradient methods with memory
• A new memory gradient method and its convergence
• A new memory gradient method under exact line search
• A new class of memory gradient methods with inexact line searches
• scientific article; zbMATH DE number 5951924

Cites work

• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
• An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
• An optimal first order method based on optimal quadratic averaging
• Complexity bounds for primal-dual methods minimizing the model of objective function
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Efficiency of the accelerated coordinate descent method on structured optimization problems
• Fast first-order methods for composite convex optimization with backtracking
• First-order methods of smooth convex optimization with inexact oracle
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 4079168 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Linear convergence of first order methods for non-strongly convex optimization
• MM optimization algorithms
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
• Relatively smooth convex optimization by first-order methods, and applications

Cited in

(3)

• A memory efficient incremental gradient method for regularized minimization
• Gradient methods with memory
• An optimal lower bound for smooth convex functions

This page was built for publication: Exact gradient methods with memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058416)