Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
type: Item
instance of: scholarly article
title: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
zbMATH Open document ID: 1466.90081
author: Zhongming Wu
author: Chongshou Li
author: Min Li
author: Andrew Lim
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7340954
zbMATH Keywords: nonconvex
zbMATH Keywords: nonsmooth
zbMATH Keywords: inertial proximal gradient method
zbMATH Keywords: Bregman regularization
zbMATH Keywords: Kurdyka-łojasiewicz property
zbMATH Keywords: global convergence
describes a project that uses: iPiano
MaRDI profile type: Publication
full work available at URL: s10898-020-00943-7
OpenAlex ID: W3074070670
cites work: An extension of the second order dynamical system that models Nesterov's convex gradient method
cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization
cites work: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
cites work: On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Regularizing with Bregman--Moreau Envelopes
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3151174
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
cites work: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Accelerated Methods for NonConvex Optimization
cites work: Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
cites work: Accelerated gradient methods for nonconvex nonlinear and stochastic programming
cites work: Sparse Signal Recovery Using Iterative Proximal Projection
cites work: A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
cites work: A generalized proximal-point-based prediction-correction method for variational inequality problems
cites work: A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization
cites work: Non-convex Optimization for Machine Learning
cites work: Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
cites work: An inertial forward-backward algorithm for monotone inclusions
cites work: Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: Convergence of a splitting inertial proximal method for monotone operators
cites work: Q3320132
cites work: Gradient methods for minimizing composite functions
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: Non-smooth non-convex Bregman minimization: unification and new algorithms
cites work: An Iterative Regularization Method for Total Variation-Based Image Restoration
cites work: Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
cites work: Some methods of speeding up the convergence of iteration methods
cites work: Variational Analysis
cites work: A simplified view of first order methods for optimization
cites work: Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
cites work: Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
cites work: General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
cites work: A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: Nearly unbiased variable selection under minimax concave penalty
DOI: 10.1007/S10898-020-00943-7
description: scientific article; zbMATH DE number 7340954