Inexact version of Bregman proximal gradient algorithm
From MaRDI portal
Publication:2198034
DOI10.1155/2020/1963980zbMath1474.90335OpenAlexW3015084491MaRDI QIDQ2198034
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- Theoretical aspect of diagonal Bregman proximal methods
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- Image deblurring with Poisson data: from cells to galaxies
- Monotone Operators and the Proximal Point Algorithm
- Perturbation des méthodes d'optimisation. Applications
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Numerical methods for nondifferentiable convex optimization
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- A Proximal Stochastic Gradient Method with Progressive Variance Reduction
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Compressed sensing
This page was built for publication: Inexact version of Bregman proximal gradient algorithm
