Inequalities of the Jensen and Edmundson-Lah-Ribarič type for 3-convex functions with applications functionals and 3-
convex functions. Obtained results are then applied to generalized means and power means
A Simple Dual Decomposition Method for Resource Allocation in Telecommunication Networks obtain a
convex optimization problem involving capacity and balance constraints. By using the dual
Necessary conditions for an extremum for 2-regular problems is a closed
convex set of Y. The authors say that the mapping Fcolon X to Y is 2-regular at a point
Immobile indices in linear Semi-infinite and Copositive Programming sets and permit to deduce efficient
optimality conditions which do need use any Constrain
Topological splines in locally convex spaces theory of locally
convex spaces. A method of their exact calculation is presented. The approximating
On operator monotone and operator convex functions© 2016, Allerton Press, Inc.We establish monotonicity and
convexity criteria for a continuous
Analytic functions with polar and logarithmic singularities and locally convex boundary values at the infinity and generalize univalent
convex functions defined in the exterior of the unit disc. We prove sharp
Positivity of sums and integrals for n-convex functions via the Fink identityWe consider the positivity of the sum Σ i=1 ; n ρ i F(ξ i ), where F is a
convex function of higher
Fejér type inequalities for higher order convex functions and quadrature formulaeThe aim of this paper is to obtain Fejér type inequalities for higher order
convex functions