On the linear convergence of a Bregman proximal point algorithm
From MaRDI portal
Publication:5088831
DOI10.23952/jnva.6.2022.2.02zbMath1493.65107OpenAlexW4312261703MaRDI QIDQ5088831
Publication date: 13 July 2022
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.6.2022.2.02
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotone (nonlinear) operators in Hilbert space
- Proximal minimization algorithm with \(D\)-functions
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- The developments of proximal point algorithms
- Warped proximal iterations for monotone inclusions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A generalized proximal point algorithm for certain non-convex minimization problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- New Proximal Point Algorithms for Convex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Bregman Monotone Optimization Algorithms
- Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems
- First-Order Methods in Optimization
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: On the linear convergence of a Bregman proximal point algorithm