New inertial proximal gradient methods for unconstrained convex optimization problems
type: Item
instance of: scholarly article
title: New inertial proximal gradient methods for unconstrained convex optimization problems
zbMATH Open document ID: 1487.47101
author: Peichao Duan
author: Yiqun Zhang
author: Qinxiong Bu
published in: Journal of Inequalities and Applications
publication date: 2022-01-20T00:00:00Z
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7461029
zbMATH Keywords: convex optimization
zbMATH Keywords: viscosity approximation
zbMATH Keywords: proximal operator
zbMATH Keywords: inertial acceleration
zbMATH Keywords: alternated inertial acceleration
zbMATH Keywords: weak convergence
MaRDI profile type: Publication
full work available at URL: s13660-020-02522-6
OpenAlex ID: W3110972966
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Strong convergence of a proximal point algorithm with bounded error sequence
cites work: Perturbation resilience and superiorization of iterative algorithms
cites work: Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
cites work: Bounded perturbation resilience of the viscosity algorithm
cites work: General viscosity iterative approximation for solving unconstrained convex optimization problems
cites work: Q3998720
cites work: Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
cites work: Solving the variational inequality problem defined on intersection of finite level sets
cites work: A generic online acceleration scheme for optimization algorithms via relaxation and inertia
cites work: Bounded perturbation resilience of projected scaled gradient methods
cites work: Properties and iterative methods for the \(Q\)-lasso
cites work: Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
cites work: Proximity algorithms for image models: denoising
cites work: Q5723437
cites work: Q3320132
cites work: Some methods of speeding up the convergence of iteration methods
cites work: Q3491338
cites work: New inertial relaxed method for solving split feasibilities
cites work: Averaged mappings and the gradient-projection algorithm
cites work: Properties and iterative methods for the lasso and its variants
cites work: Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
cites work: A regularized algorithm for the proximal split feasibility problem
DOI: 10.1186/S13660-020-02522-6
description: scientific article; zbMATH DE number 7461029