An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
type: Item
instance of: scholarly article
title: An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
zbMATH Open document ID: 1499.90173
author: Zehui Jia
author: Zhongming Wu
author: Xiaomei Dong
published in: Journal of Inequalities and Applications
publication date: 2022-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 94A08
zbMATH DE Number: 7459153
zbMATH Keywords: nonconvex minimization
zbMATH Keywords: proximal gradient algorithm
zbMATH Keywords: relative error criterion
zbMATH Keywords: extrapolation
zbMATH Keywords: global convergence
describes a project that uses: iPiano
MaRDI profile type: Publication
full work available at URL: s13660-019-2078-7
OpenAlex ID: W2947118266
cites work: Decoding by Linear Programming
cites work: Compressed sensing
cites work: An algorithm for total variation minimization and applications
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Q5144455
cites work: Adaptive restart for accelerated gradient schemes
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
cites work: Q4704621
cites work: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
cites work: A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
cites work: Sparse solutions to random standard quadratic optimization problems
Wikidata QID: Q127920251
DOI: 10.1186/S13660-019-2078-7
description: scientific article; zbMATH DE number 7459153