Results 31 to 40 of about 7,004,346 (287)
Convex Analysis for Minimizing and Learning Submodular Set Functions [PDF]
The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions. First, we develop a novel method for minimizing a particular class of submodular functions, which can be expressed as a
Peter Stobbe, Stobbe, Peter
core +1 more source
Geometric properties of Wright function [PDF]
In the present paper, we investigate certain geometric properties and inequalities for the Wright function and mention a few important consequences of our main results. A nonlinear differential equation involving the Wright function is also investigated.
Sudhananda Maharana +2 more
doaj +1 more source
Jensen–Steffensen inequality for strongly convex functions [PDF]
The Jensen inequality for convex functions holds under the assumption that all of the included weights are nonnegative. If we allow some of the weights to be negative, such an inequality is called the Jensen-Steffensen inequality for convex functions. In this paper we prove the Jensen-Steffensen inequality for strongly convex functions.
openaire +6 more sources
We consider a general class of convex optimization problems in which one seeks to minimize a strongly convex function over a closed and convex set, which is by itself an optimal set of another mixed variational inequality problem in a Hilbert space ...
Wei-Bo Guan, Wen Song
doaj +1 more source
Around Jensen’s inequality for strongly convex functions [PDF]
In this paper we use basic properties of strongly convex functions to obtain new inequalities including Jensen's type and Jensen-Mercer type inequalities. Applications for special means are pointed out as well. We also give a Jensen's operator inequality for strongly convex functions. As a corollary, we improve Hölder-McCarthy inequality under suitable
Moradi, Hamid Reza +3 more
openaire +3 more sources
Bounds for the Čebyšev Functional of a Convex and a Bounded Function [PDF]
Upper and lower bounds for the Čebyšev functional of a convex and a bounded function are given.
Dragomir, Sever S, Barnett, Neil S
core +5 more sources
The symmetric function class interacts heavily with other types of functions. One of these is the convex function class, which is strongly related to symmetry theory.
Muhammad Bilal Khan +4 more
doaj +1 more source
On the Location of the Minimizer of the Sum of Two Strongly Convex Functions [PDF]
The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this paper, we provide an upper bound on the region containing the minimizer of the sum of two strongly ...
Kananart Kuwaranancharoen +1 more
openaire +3 more sources
Further Geometric Properties of the Barnes–Mittag-Leffler Function
In this paper, we find sufficient conditions to be imposed on the parameters of a class of functions related to the Barnes–Mittag-Leffler function that allow us to conclude that it possesses certain geometric properties (such as starlikeness, uniformly ...
Abdulaziz Alenazi, Khaled Mehrez
doaj +1 more source
Set-Theoretic Inequalities Based on Convex Multi-Argument Approximate Functions via Set Inclusion
Hypersoft set is a novel area of study which is established as an extension of soft set to handle its limitations. It employs a new approximate mapping called multi-argument approximate function which considers the Cartesian product of attribute-valued ...
Atiqe Ur Rahman +3 more
doaj +1 more source

