Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\)
type: Item
instance of: scholarly article
title: Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\)
zbMATH Open document ID: 1502.90134
author: Huynh Van Ngai
author: Ta Anh Son
published in: Computational Optimization and Applications
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7596185
zbMATH Keywords: convex optimization
zbMATH Keywords: forward-backward method
zbMATH Keywords: Nesterov accelerated gradient method
zbMATH Keywords: proximal mapping
zbMATH Keywords: subdifferential
MaRDI profile type: Publication
full work available at URL: s10589-022-00401-y
OpenAlex ID: W4292651679
cites work: The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
cites work: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
cites work: Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Convex optimization: algorithms and complexity
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: An Optimal First Order Method Based on Optimal Quadratic Averaging
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Convex programming in Hilbert space
cites work: Optimized first-order methods for smooth convex minimization
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Smooth minimization of non-smooth functions
cites work: Gradient methods for minimizing composite functions
cites work: Universal gradient methods for convex optimization problems
cites work: Linear convergence of first order methods for non-strongly convex optimization
cites work: Weak convergence of the sequence of successive approximations for nonexpansive mappings
DOI: 10.1007/S10589-022-00401-Y
description: scientific article; zbMATH DE number 7596185