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

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

Авторов:
761 409

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

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

A modified combined relaxation method for non-linear convex variational inequalitiesA modified combined relaxation method for non-linear convex variational inequalities

More accurate classes of jensen–type inequalities for convex and operator convex functions-adjoint operators. The first class refers to a usual convexity, while the second one deals with the operator

Immobile indices and CQ-free optimality criteria for Linear Copositive Programming problems be represented as a union of a finite number of convex closed bounded polyhedra. We show that the study

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

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

FURTHER IMPROVEMENT OF AN EXTENSION OF HOLDER-TYPE INEQUALITY their result in a measure theoretic sense and further improve it using log-convexity of related linear

Immobile Indices and CQ-Free Optimality Criteria for Linear Copositive Programming Problems be represented as a union of a finite number of convex closed bounded polyhedra. We show that the study

Lah–Ribarič type inequalities for (h, g; m)-convex functionsRecently introduced new class of (h, g; m)-convex functions unifies a certain range of convexity

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

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