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

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

Авторов:
761 409

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

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

Cutting-plane method with embedding of epigraphs of auxiliary functions© 2017 IEEE. We propose a method of conditional minimization of convex functions from the class

Inequalities of Ando's Type for n-convex FunctionsInequalities of Ando's Type for n-convex Functions

Application of the conditional gradient method to resource allocation in wireless networks of this resource. This approach leads to a convex optimization problem, which is solved with a dual Lagrangian

Joint Distribution of the Number of Vertices and the Area of Convex Hulls Generated by a Uniform Distribution in a Convex PolygonA convex hull generated by a sample uniformly distributed on the plane is considered in the case

To the theory of operator monotone and operator convex functionsWe prove that a real function is operator monotone (operator convex) if the corresponding

On the Coefficients of Quasiconformality for Convex FunctionsLet f be holomorpic and univalent in the unit disc E and f(E) be convex. We consider the conformal

Application of the conditional gradient method to resource allocation in wireless networks of this resource. This approach leads to a convex optimization problem, which is solved with a dual Lagrangian

Decomposition method for zonal resource allocation problems in telecommunication networks. We obtain a convex quadratic optimization problem involving capacity and balance constraints

A Simple Dual Decomposition Method for Resource Allocation in Telecommunication Networks obtain a convex optimization problem involving capacity and balance constraints. By using the dual

Dual methods for optimal allocation of total network resources volumes of this resource. This approach leads to a constrained convex optimization problem. We discuss

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