The Bregman distance without the Bregman function. II
DOI10.1090/CONM/568/11284zbMATH Open1290.47058OpenAlexW4232135723MaRDI QIDQ2906491FDOQ2906491
Authors: Daniel Reem 
Publication date: 5 September 2012
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/568/11284
Recommendations
- scientific article; zbMATH DE number 932419
- Minimax Theorems with Bregman Distance in Banach Spaces
- Weak convergence theorems for firmly generalized nonexpansive mappings with Bregman distances in Banach spaces
- Weak convergence theorems for Bregman generalized nonexpansive mappings in Banach spaces
- Convergence theorems for Bregman strongly nonexpansive mappings in reflexive Banach spaces
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Cited In (6)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- Weak convergence theorems for firmly generalized nonexpansive mappings with Bregman distances in Banach spaces
- Re-examination of Bregman functions and new properties of their divergences
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- On weak convergence in metric spaces
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
This page was built for publication: The Bregman distance without the Bregman function. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906491)
