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

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

Авторов:
761 409

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

Страница 9 из 33489

Jensen-type inequalities on time scales for n-convex functions in the Edmundson-Lah-Ribarič inequality in time scales calculus that holds for the class of n-convex functions

A Non-monotone Conjugate Subgradient Type Method for Minimization of Convex Functions subgradient type method without any line search for minimization of convex non-differentiable functions

On sets of measurable operators convex and closed in topology of convergence in measureWe investigate some sets of measurable operators convex and closed in topology of convergence

The method of multipliers for nonlinearly constrained variational inequalities and convex differentiable constraints is considered. We prove the convergence of the method with an arbitrary

Constructing Mixed Algorithms on the Basis of Some Bundle Method nondifferentiable convex function. This method belongs to a class of bundle methods. In the developed method

Conformal radius has unique critical point when pre-Schwarzian derivative is subordinate to classical majorantsConformal radius has unique critical point when pre-Schwarzian derivative is subordinate

Radii of convexity and close-to-convexity of certain integral representationsStrict upper bounds are determined for |s(z)|, |Re s(z)|, and |Im s(z) | in the class of functions

Hardy type inequalities with weights dependent on the bessel functions in domains with a finite inradius. The weight functions depend on the Bessel functions and Lamb’ s constants.

Extended Jensen’s functional for diamond integral via Green’s function and Hermite polynomial of Jensen’s functional for n-convex functions is deduced from Jensen’s inequality involving diamond

A version of the penalty method with approximation of the epigraphs of auxiliary functions© 2019, Kazan Federal University. All rights reserved. A method for solving the convex programming

Страница 9 из 33489