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
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