Related papers: On Characterizations of (Almost) Strictly Convex F…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
A characterization of the proximal normal cone is obtained and a separation theorem for convex subsets of Riemannian manifolds is established. Moreover, the convexity of the distance function $d_S$ for a convex subset $S$ in the cases where…
This paper presents a general study of one-dimensional differentiability for functionals defined on convex domains that are not necessarily open. The local approximation is carried out using affine functionals, as opposed to linear…
We study differentiable strongly quasiconvex functions for providing new properties for algorithmic and monotonicity purposes. Furthemore, we provide insights into the decreasing behaviour of strongly quasiconvex functions, applying this…
An important open problem in geometric complex analysis is to find algorithms for explicit determination of basic functionals intrinsically connected with conformal and quasiconformal maps, such as their Teichmuller and Grunsky norms,…
For convex univalent functions we give instances where the sharp bound for various coefficient functionals are identical to those for the corresponding bound for the inverse function. We give instances where the sharp bounds differ and also…
In convex geometry, the Blaschke surface area measure on the boundary of a convex domain can be interpreted in terms of the complexity of approximating polyhedra. In response to a question raised by D. Barrett, this approach is formulated…
In this paper, we establish characterizations of variational $s$-convexity and tilt stability for prox-regular functions in the absence of subdifferential continuity via quadratic bundles, a kind of primal-dual generalized second-order…
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal {\epsilon}-subdifferentials, by incorporating the moduli of weak convexity of the functions into the respective formulas.…
We show that the existence of a strongly convex function with a Lipschitz derivative on a Banach space already implies that the space is isomorphic to a Hilbert space. Similarly, if both a function and its convex conjugate are $C^2$ then…
Computing explicitly the {\epsilon}-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting theoretical algorithm is applied to the the class…
In this article, we further explore convex functions by revealing new bounds, resulting from stronger convexity behavior. In particular, we define the so called radical convex functions and study their properties. We will see that such…
We give properties of strict pseudocontractions and demicontractions defined on a Hilbert space, which constitute wide classes of operators that arise in iterative methods for solving fixed point problems. In particular, we give necessary…
In this paper we give some results about the approximation of a Lipschitz function on a Banach space by means of $\Delta$-convex functions. In particular, we prove that the density of $\Delta$-convex functions in the set of Lipschitz…
In this paper, in particular, we prove the following result: Let $E$ be a reflexive real Banach space and let $C\subset E$ be a closed convex set, with non-empty interior, whose boundary is sequentially weakly closed and non-convex. Then,…
The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space,…
The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…
We investigate the convergence properties of exact and inexact forward-backward algorithms to minimise the sum of two weakly convex functions defined on a Hilbert space, where one has a Lipschitz-continuous gradient. We show that the exact…
Abstract Equivalent conditions that make the convex subdifferential maximal monotone are investigated in the general settings of locally convex spaces.
A real-valued set function is (additively) approximately submodular if it satisfies the submodularity conditions with an additive error. Approximate submodularity arises in many settings, especially in machine learning, where the function…