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

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

Авторов:
761 409

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

Страница 8 из 6051

Условия оптимальности для негладких задач выпуклого программированияIn the article, we consider nonsmooth convex programming problems of special type. Such a class

Sharp Hardy-type inequalities with Lamb's constantsLet Ω be an n-dimensional convex domain with finite inradius δ 0 = sup xεΩ δ, where δ = dist

Milyutin's Theorem in Linear-Quadratic Optimal Control Problems quadratic constraints of equality and inequality type. For such a problem, which is not convex in general

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

On Zipf-Mandelbrot entropy and 3-convex functions and the 3-convexity of the function. Further, we define linear functionals as the nonnegative differences

Theoretical fundamentals for unimodality estimation of an objective functional in the optimal control problem and convexity of functionals. The nontriviality of the problem of estimating the unimodality of a functional

Generalized fractional integral inequalities for exponentially (s, m) -convex functions) -convex functions. These inequalities provide upper bounds, boundedness, continuity, and Hadamard type

A Logarithmic Barrier Approach Via Majorant Function for Nonlinear ProgrammingIn this paper, we are interested in solving an optimization nonlinear programming problem using a

On Limit Theorem for the Number of Vertices of the Convex Hulls in a Unit DiskThis paper is devoted to further investigation of the property of a number of vertices of convex

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

Страница 8 из 6051