Decomposition method for zonal resource allocation problems in telecommunication networks. We obtain a
convex quadratic
optimization problem involving capacity and balance constraints
The punishing factors for convex pairs are 2n-1 with curvature and λ = -4 of Ω at z and of w, respectively. Then for any pair (Ω, ∏) of
convex domains, f ∈ A
POPOVICIU TYPE INEQUALITIES FOR HIGHER ORDER CONVEX FUNCTIONS VIA LIDSTONE INTERPOLATION Sigma(m)(i=1) p(i)f(x(i)) , where f is an n-
convex function with even n. We also give integral analogues
A Subgradient Projection Method for Set-Valued Network Equilibrium Problems additional assumptions, it can be replaced with a nonsmooth
convex optimization problem. We propose to apply
Hardy type L p-inequalities in r-close-to-convex domains© 2015, Allerton Press, Inc. We describe non-
convex domains for which the Hardy constants
Theorems of the Alternative for Systems of Convex InequalitiesSystems of
convex inequalities in function spaces are considered. Solvability conditions
On Shannon and Zipf–Mandelbrot entropies and related results construct new family of exponentially
convex functions and Cauchy-type means. © 2019, The Author(s).
Toward Smart Traffic Management With 3D Placement Optimization in UAV-Assisted NOMA IIoT Networks non-
convex in the coordinates. Therefore, we employ an improved adaptive whale
optimization algorithm