Inexact version of Bregman proximal gradient algorithm
From MaRDI portal
Publication:2198034
DOI10.1155/2020/1963980zbMATH Open1474.90335OpenAlexW3015084491MaRDI QIDQ2198034FDOQ2198034
Authors: Saïd Kabbadj 
Publication date: 8 September 2020
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/1963980
Recommendations
- Approximate iterations in Bregman-function-based proximal algorithms
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- An inexact Riemannian proximal gradient method
- An inexact proximal regularization method for unconstrained optimization
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- The Bregman proximal average
- Inexact Halpern-type proximal point algorithm
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Inexact projected gradient method for vector optimization
- Inexact proximal stochastic gradient method for convex composite optimization
Cites Work
- Title not available (Why is that?)
- Compressed sensing
- Title not available (Why is that?)
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Image deblurring with Poisson data: from cells to galaxies
- Monotone Operators and the Proximal Point Algorithm
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- Title not available (Why is that?)
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A proximal stochastic gradient method with progressive variance reduction
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Numerical methods for nondifferentiable convex optimization
- Perturbation des méthodes d'optimisation. Applications
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- Title not available (Why is that?)
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Entropic proximal methods
- Global convergence rate of proximal incremental aggregated gradient methods
- Theoretical aspect of diagonal Bregman proximal methods
Cited In (2)
This page was built for publication: Inexact version of Bregman proximal gradient algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198034)
