Материалов:
1 005 012

Репозиториев:
30

Авторов:
761 409

По вашему запросу найдено документов: 41858

Страница 4 из 4186

The punishing factors for convex pairs are 2n-1 with the set A(Ω, ∏) of functions f : Ω → ∏ holomorphic on Ω and we prove estimates for |f(n)(z)|, f ∈ A(Ω, Ω

Theorems of the Alternative for Systems of Convex InequalitiesSystems of convex inequalities in function spaces are considered. Solvability conditions

CONSTRUCTIONS OF INPUT AND OUTPUT ISOQUANTS IN DEA MODELS WITH SELECTIVE CONVEXITY Envelopment Analysis models with selective convexity. Computational ex-periments using real-life datasets

Sharp Hardy type inequalities with weights depending on bessel function these inequalities for the case of convex domains with a finite inner radius. The proved statements

Classes of uniformly convex and uniformly starlike functions as dual setsIn this paper the classes of uniformly convex and uniformly starlike functions are presented

Properties and Applications of the Distance Functions on Open Sets of the Euclidean Space interior and exterior approximations by sequences of open sets. We prove convergence everywhere

A minimization algorithm with approximation of an epigraph of the objective function and a constraint setCopyright © by the paper's authors.An algorithm is suggested for solving a convex programming

On e-subgradient methods of non-differentiable optimizationOn e-subgradient methods of non-differentiable optimization

A minimization method with approximation of feasible set and epigraph of objective function© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which

Fractional Integral Inequalities via Atangana-Baleanu Operators for Convex and Concave Functions integral operators is proved. Then, new fractional integral inequalities have been obtained for convex

Страница 4 из 4186