Re-examination of Bregman functions and new properties of their divergences

DOI10.1080/02331934.2018.1543295zbMath1407.52008arXiv1803.00641OpenAlexW2790371392MaRDI QIDQ4613995

Daniel Reem, Simeon Reich, Alvaro Rodolfo de Pierro

Publication date: 28 January 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.00641

zbMATH Keywords

uniformly convexBregman functiongaugeBregman divergencestrongly convexnegative Boltzmann-Gibbs-Shannon entropynegative Burg entropynegative Havrda-Charvát-Tsallis entropynegative iterated log entropyrelative uniform convexity

Mathematics Subject Classification ID

Convex programming (90C25) Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Convexity of real functions of several variables, generalizations (26B25) Real-valued functions on manifolds (58C05) Nonlinear functional analysis (46T99)

Related Items (41)

Extragradient algorithm for solving pseudomonotone equilibrium problem with Bregman distance in reflexive Banach spaces ⋮ A Bregman subgradient extragradient method with self-adaptive technique for solving variational inequalities in reflexive Banach spaces ⋮ A convergence theorem for solving generalized mixed equilibrium problems and finding fixed points of a weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ Two New Inertial Algorithms for Solving Variational Inequalities in Reflexive Banach Spaces ⋮ A strong convergence theorem for quasi-equilibrium problems in Banach spaces ⋮ Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems ⋮ Inertial self-adaptive Bregman projection method for finite family of variational inequality problems in reflexive Banach spaces ⋮ Solving a general split equality problem without prior knowledge of operator norms in Banach spaces ⋮ A strong convergence algorithm for solving pseudomonotone variational inequalities with a single projection ⋮ Strong convergence of a generalized forward–backward splitting method in reflexive Banach spaces ⋮ An inertial method for split equality common \(f, g\)-fixed point problems of \(f, g\)-pseudocontractive mappings in reflexive real Banach spaces ⋮ Mann-type algorithms for solving the monotone inclusion problem and the fixed point problem in reflexive Banach spaces ⋮ A strong convergence theorem under a new shrinking projection method for nonlinear mappings in reflexive Banach spaces ⋮ A strong convergence theorem for solving pseudo-monotone variational inequalities using projection methods ⋮ Convergence rates for nonlinear inverse problems of parameter identification using Bregman distances ⋮ Convergence analysis of a new Bregman extragradient method for solving fixed point problems and variational inequality problems in reflexive Banach spaces ⋮ Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces ⋮ Novel inertial methods for fixed point problems in reflexive Banach spaces with applications ⋮ Strong Convergence Theorem Obtained by a Generalized Projections Method for Solving an Equilibrium Problem and Fixed Point Problems ⋮ A strongly convergent algorithm for solving multiple set split equality equilibrium and fixed point problems in Banach spaces ⋮ Accelerated Bregman projection rules for pseudomonotone variational inequalities and common fixed point problems ⋮ The method of randomized Bregman projections for stochastic feasibility problems ⋮ A modified inertial Halpern method for solving split monotone variational inclusion problems in Banach spaces ⋮ Inertial‐like Bregman projection method for solving systems of variational inequalities ⋮ Fast and simple Bregman projection methods for solving variational inequalities and related problems in Banach spaces ⋮ Unnamed Item ⋮ The Generalized Bregman Distance ⋮ A novel kernelized total Bregman divergence-based fuzzy clustering with local information for image segmentation ⋮ On the shrinking projection method for the split feasibility problem in Banach spaces ⋮ A strong convergence theorem for a finite family of Bregman demimetric mappings in a Banach space under a new shrinking projection method ⋮ Approximation of a common \(f\)-fixed point of \(f\)-pseudocontractive mappings in Banach spaces ⋮ A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces ⋮ A Tseng extragradient method for solving variational inequality problems in Banach spaces ⋮ Upper and lower bounds for the Bregman divergence ⋮ Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities ⋮ Convergence analysis for variational inequalities and fixed point problems in reflexive Banach spaces ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption ⋮ On the rate of convergence of iterated Bregman projections and of the alternating algorithm ⋮ A strong convergence theorem for approximation of a zero of the sum of two maximal monotone mappings in Banach spaces ⋮ Compositions and convex combinations of Bregman weakly relatively nonexpansive operators in reflexive Banach spaces ⋮ A strong convergence theorem for solving an equilibrium problem and a fixed point problem using the Bregman distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Convergence of a proximal-like algorithm in the presence of computational errors
• An algorithm for maximum entropy image reconstruction from noisy data
• Families of alpha-, beta- and gamma-divergences: flexible and robust measures of similarities
• Convex functions, monotone operators and differentiability.
• Optimization of Burg's entropy over linear constraints
• Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
• Klee sets and Chebyshev centers for the right Bregman distance
• Functional analysis, Sobolev spaces and partial differential equations
• A relaxed version of Bregman's method for convex programming
• The non-existence of smooth demand in general Banach spaces
• An iterative row-action method for interval convex programming
• On uniformly convex functionals
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Approximate iterations in Bregman-function-based proximal algorithms
• Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
• Enlargement of monotone operators with applications to variational inequalities
• Introductory lectures on convex optimization. A basic course.
• Totally convex functions for fixed points computation and infinite dimensional optimization
• Fixed points of polarity type operators
• Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Some properties of generalized proximal point methods for quadratic and linear programming
• Possible generalization of Boltzmann-Gibbs statistics.
• A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
• Forward-backward splitting with Bregman distances
• Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
• A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances
• The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
• Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
• The Bregman Distance without the Bregman Function II
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Constructions of Uniformly Convex Functions
• General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
• Computationally feasible high-resolution minimum-distance procedures which extend the maximum-entropy method
• Introduction to Nonextensive Statistical Mechanics
• On the Optimality of Conditional Expectation as a Bregman Predictor
• Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
• Uniformly convex functions on Banach spaces
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• Proximal Minimization Methods with Generalized Bregman Functions
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Construction of best Bregman approximations in reflexive Banach spaces
• Bregman Monotone Optimization Algorithms
• ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
• On inexact generalized proximal methods with a weakened error tolerance criterion
• Information gain within nonextensive thermostatistics
• Information Geometry of U-Boost and Bregman Divergence
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Convex Analysis
• Notes on maximum-entropy processing (Corresp.)
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
• Dual convergence of the proximal point method with Bregman distances for linear programming
• On Information and Sufficiency
• Convex analysis and monotone operator theory in Hilbert spaces
• On uniformly convex functions
• Nonextensive statistical mechanics and its applications. Papers from the IMS winter school on statistical mechanics: nonextensive generalization of Boltzmann-Gibbs statistical mechanics and its applications, Okazaki, Japan, February 15--18, 1999
• Logistic regression, AdaBoost and Bregman distances
• Bregman Voronoi diagrams

This page was built for publication: Re-examination of Bregman functions and new properties of their divergences