The Bregman Distance without the Bregman Function II
From MaRDI portal
Publication:2906491
DOI10.1090/CONM/568/11284zbMath1290.47058OpenAlexW4232135723MaRDI QIDQ2906491
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
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (4)
Re-examination of Bregman functions and new properties of their divergences ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
This page was built for publication: The Bregman Distance without the Bregman Function II
