A dual Bregman proximal gradient method for relatively-strongly convex optimization
From MaRDI portal
Publication:2092292
Recommendations
- scientific article; zbMATH DE number 1070393
- A fast dual proximal gradient algorithm for convex minimization and applications
- Dual convergence of the proximal point method with Bregman distances for linear programming
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- On dual convergence of the generalized proximal point method with Bregman distances
- A dual regularized method for solving a class of convex minimization problems
- A bundle Bregman proximal method for convex nondifferentiable minimization
- Proximal Minimization Methods with Generalized Bregman Functions
- A dual split Bregman method for fast \(\ell ^{1}\) minimization
- A dual gradient-projection method for large-scale strictly convex quadratic problems
Cites work
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A fast dual proximal gradient algorithm for convex minimization and applications
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- A generalized proximal point algorithm for certain non-convex minimization problems
- A simplified view of first order methods for optimization
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- First-order methods in optimization
- Gradient-based algorithms with applications to signal-recovery problems
- Image deblurring with Poisson data: from cells to galaxies
- Joint and separate convexity of the Bregman distance.
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Optimum Designs in Regression Problems
- Relatively smooth convex optimization by first-order methods, and applications
- Splitting Algorithms for the Sum of Two Nonlinear Operators
Cited in
(5)- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- A fast dual proximal gradient algorithm for convex minimization and applications
- On dual convergence of the generalized proximal point method with Bregman distances
- Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization
- Dual space preconditioning for gradient descent
This page was built for publication: A dual Bregman proximal gradient method for relatively-strongly convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2092292)
