По вашему запросу найдено документов: 23363
Страница 21 из 2337
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
АЛГОРИТМ ОТСЕЧЕНИЙ НА ОСНОВЕ ОДНОВРЕМЕННОЙ АППРОКСИМАЦИИ ДОПУСТИМОЙ ОБЛАСТИ И НАДГРАФИКА ЦЕЛЕВОЙ ФУНКЦИИPropose an algorithm for solving a convex programming problem. The algorithm belongs to the class
Generalization of cyclic refinements of Jensen’s inequality by Fink’s identityWe generalize cyclic refinements of Jensen’s inequality from a convex function to a higher
Refinement and corrigendum of bounds of fractional integral operators containing mittag-leffler functions operators for convex, m-convex, s-convex and (s, m)-convex functions. Moreover, the refinements of some
On idempotent τ-measurable operators affiliated to a von Neumann algebra. In this case, 1) if A ≠ 0, then the values of the nonincreasing rearrangement μt(A) belong to the set {0
Existence analysis and numerical approximation for a second-order model of traffic with orderliness marker, an original treatment of local GSOM-like models in the BV setting is briefly discussed, in relation
МЕТОД ОТЫСКАНИЯ ПРОЕКЦИИ ТОЧКИ, ОСНОВАННЫЙ НА ПРОЦЕДУРАХ ОТСЕЧЕНИЙPropose a method for finding a projection of the point on the convex set. In the method iteration
Necessary conditions for an extremum for 2-regular problems is a closed convex set of Y. The authors say that the mapping Fcolon X to Y is 2-regular at a point
One cutting plane algorithm using auxiliary functions© Published under licence by IOP Publishing Ltd.We propose an algorithm for solving a convex
Страница 21 из 2337
Фасеты
Партнеры
Индексация
