Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
From MaRDI portal
Publication:2022322
DOI10.1007/s10898-020-00943-7zbMath1466.90081OpenAlexW3074070670MaRDI QIDQ2022322
Chongshou Li, Min Li, Zhongming Wu, Andrew E. B. Lim
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00943-7
global convergencenonconvexnonsmoothBregman regularizationinertial proximal gradient methodKurdyka-łojasiewicz property
Related Items
An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems, A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems, On Proximal Algorithms with Inertial Effects Beyond Monotonicity, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant, Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem, Unnamed Item, An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Gradient methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An inertial forward-backward algorithm for monotone inclusions
- A generalized proximal-point-based prediction-correction method for variational inequality problems
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- A simplified view of first order methods for optimization
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- An extension of the second order dynamical system that models Nesterov's convex gradient method
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Regularizing with Bregman--Moreau Envelopes
- Accelerated Methods for NonConvex Optimization
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Sparse Signal Recovery Using Iterative Proximal Projection
- A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization
- Non-convex Optimization for Machine Learning
- A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Some methods of speeding up the convergence of iteration methods
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
