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
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
Dual approach for a class of implicit convex optimization problems as a generalization of a
convex optimization problem under arbitrary right-hand side constraint
On sets of measurable operators convex and closed in topology of convergence in measureWe investigate some sets of measurable
operators convex
and closed in topology of convergence
On the coefficients of concave univalent functions domain whose complement with respect to ℂ̄ is
convex. We call these functions
concave univalent functions
A note on definition of matrix convex functionsWe prove that a real-valued function f defined on an interval S in R is matrix
convex if and only
Sharp inequalities for the coefficients of concave schlicht functions assume that f(D) is unbounded and ℂ \ f(D) is a
convex domain. In this article, we consider the Taylor
On the coefficients of concave univalent functions domain whose complement with respect to ℂ̄ is
convex. We call these functions
concave univalent functions