The Generalized Bregman Distance
From MaRDI portal
Publication:5147034
DOI10.1137/19M1288140OpenAlexW3128847595MaRDI QIDQ5147034
Minh N. Dao, Scott B. Lindstrom, Regina Sandra Burachik
Publication date: 2 February 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.08206
regularizationconvex functionBregman distanceFitzpatrick functionrepresentative functiongeneralized Bregman distanceFitzpatrick distance
Convex programming (90C25) Sensitivity, stability, well-posedness (49K40) Monotone operators and generalizations (47H05)
Related Items
On Bregman-type distances and their associated projection mappings ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Enlargements: a bridge between maximal monotonicity and convexity ⋮ Unnamed Item ⋮ Generalized Bregman envelopes and proximity operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- Fitzpatrick functions, cyclic monotonicity and Rockafellar's antiderivative
- An iterative row-action method for interval convex programming
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Proximal minimization algorithm with \(D\)-functions
- On Bregman-type distances for convex functions and maximally monotone operators
- On the Lambert \(w\) function
- Maximal monotone operators, convex functions and a special family of enlargements
- Set-valued mappings and enlargement of monotone operators.
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- Inexact Proximal Point Methods for Variational Inequality Problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
- Variational Analysis
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A generalized proximal point algorithm for the nonlinear complementarity problem
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- Regularizing with Bregman--Moreau Envelopes
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
- Re-examination of Bregman functions and new properties of their divergences
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Block-Iterative Algorithms with Underrelaxed Bregman Projections
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Proximité et dualité dans un espace hilbertien
- Proximal Averages for Minimization of Entropy Functionals
- Convex analysis and monotone operator theory in Hilbert spaces
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
This page was built for publication: The Generalized Bregman Distance
