По вашему запросу найдено документов: 65085
Страница 10 из 6509
On Rabier's result and nonbounded montgomery's identity of result from [9] for the class of n-convex functions. © 2019 Element D.O.O. All Rights Reserved.
Refinements of some fractional integral inequalities for refined (α, h− m) -convex function via the refined (α, h− m) -convex function. The established results give refinements of fractional
Критерий оптимальности для задач выпуклого полубесконечного программирования с аналитическими функциями ограниченийOptimality criteria for convex semi- infinite programming problems
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
Extremality of convex sets with some applicationsIn this paper we introduce an enhanced notion of extremal systems for sets in locally convex
Boundedness of fractional integral operators containing mittag-leffler functions via (S, m)-convexity Mittag-Leffler functions in the kernels. By using (s, m)-convex functions bounds of these operators
Conformal radius: At the interface of traditions convex holomorphic function into the Gakhov class.
One algorithm for branch and bound method for solving concave optimization problem the necessary and sufficient conditions of optimum for the original problem and for a convex programming problem
Variational Geometric Approach to Generalized Differential and Conjugate Calculi in Convex AnalysisThis paper develops a geometric approach of variational analysis for the case of convex objects
Страница 10 из 6509
Фасеты
Партнеры
Индексация
