An inertial Bregman proximal gradient algorithm for nonconvex composite optimization problems
From MaRDI portal
Cites work
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A simplified view of first order methods for optimization
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Convex Optimization in Signal Processing and Communications
- Decentralized Quasi-Newton Methods
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Linear algebra
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
- Relatively smooth convex optimization by first-order methods, and applications
- The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property
This page was built for publication: An inertial Bregman proximal gradient algorithm for nonconvex composite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005543)
