A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
From MaRDI portal
Cited in
(14)- Exact gradient methods with memory
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Linearly-convergent FISTA variant for composite optimization with duality
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
- Parameter-free FISTA by adaptive restart and backtracking
- A C-FISTA-type Krasnosel'skiĭ-Mann iteration with applications to TV-based denoising problem and image in-painting
- Kernel FISTA and application to image deblurring
- An optimal lower bound for smooth convex functions
- FISTA restart using an automatic estimation of the growth parameter
- C-FISTA type projection algorithm for quasi-variational inequalities
- Nesterov's acceleration at the limit: first-order schemes
- A C-FISTA-type proximal point algorithm for strongly quasiconvex pseudomonotone equilibrium problems
This page was built for publication: A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102841)