Related papers: Generalized Bregman envelopes and proximity operat…

In this paper a new family of minimum divergence estimators based on the Bregman divergence is proposed, where the defining convex function has an exponential nature. These estimators avoid the necessity of using an intermediate kernel…

In this paper, we provide a simple convergence analysis of proximal gradient algorithm with Bregman distance, which provides a tighter bound than existing result. In particular, for the problem of minimizing a class of convex objective…

In a previous paper, the authors showed that in a reflexive Banach space the lower limit of a sequence of maximal monotone operators is always representable by a convex function. The present paper gives precisions to the latter result by…

In this paper an asymmetrical operator of generalised translation is introduced, the generalised modulus of smoothness is defined by its means and the direct and inverse theorems in approximation theory are proved for that modulus. ----- V…

We construct a new kind of measures, called projection families, which generalize the classical notion of vector and operator-valued measures. The maximal class of reasonable functions admits an integral with respect to a projection family,…

We introduce a subfamily of additive enlargements of a maximally monotone operator. Our definition is inspired by the early work of Simon Fitzpatrick. These enlargements constitute a subfamily of the family of enlargements introduced by…

Recently, the authors studied the connection between each maximal monotone operator T and a family H(T) of convex functions. Each member of this family characterizes the operator and satisfies two particular inequalities. The aim of this…

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

This article is the second one of three successive articles of the authors on the matrix-weighted Besov-type and Triebel--Lizorkin-type spaces. In this article, we obtain the sharp boundedness of almost diagonal operators on matrix-weighted…

In a recent paper in Journal of Convex Analysis the authors studied, in non-reflexive Banach spaces, a class of maximal monotone operators, characterized by the existence of a function in Fitzpatrick's family of the operator which conjugate…

We propose a forward-backward splitting algorithm based on Bregman distances for composite minimization problems in general reflexive Banach spaces. The convergence is established using the notion of variable quasi-Bregman monotone…

In recent years, by using Bregman distance, the Lipschitz gradient continuity and strong convexity were lifted and replaced by relative smoothness and relative strong convexity. Under the mild assumptions, it was proved that gradient…

We introduce and investigate a new generalized convexity notion for functions called prox-convexity. The proximity operator of such a function is single-valued and firmly nonexpansive. We provide examples of (strongly) quasiconvex, weakly…

Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…

The constrained minimization (respectively maximization) of directed distances and of related generalized entropies is a fundamental task in information theory as well as in the adjacent fields of statistics, machine learning, artificial…

Taking as model the attractor of an iterated function system consisting of phi-contractions on a complete and bounded metric space, we introduce the set-theoretic concept of family of functions having attractor. We prove that, given such a…

This paper studies function approximation for finite horizon discrete time Markov decision processes under certain convexity assumptions. Uniform convergence of these approximations on compact sets is proved under several sampling schemes…

We study a family of distance functions on rankings that allow for asymmetric treatments of alternatives and consider the distinct relevance of the top and bottom positions for ordered lists. We provide a full axiomatic characterization of…

We consider the problem of minimizing the sum of two convex functions: one is differentiable and relatively smooth with respect to a reference convex function, and the other can be nondifferentiable but simple to optimize. We investigate a…

Generalized translation operators for orthogonal expansions with respect to families of weight functions on the unit ball and on the standard simplex are studied. They are used to define convolution structures and modulus of smoothness for…