In this paper we consider the extreme points of closed convex hull of the class T σ(p,α) and then it is used to determine the coefficient bounds. Some other interesting properties of the class T σ(p,α) are also...In this paper we consider the extreme points of closed convex hull of the class T σ(p,α) and then it is used to determine the coefficient bounds. Some other interesting properties of the class T σ(p,α) are also investigated.展开更多
When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for comp...When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.展开更多
In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and con...In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem using the existing algorithms about them.展开更多
Abstract In this paper, the author considers a class of bounded pseudoconvex domains, i.e., the generalized Cartan-Hartogs domains Ω（μ, m）. The first result is that the natural Kahler metric gΩ（μ,m） of Ω（μ...Abstract In this paper, the author considers a class of bounded pseudoconvex domains, i.e., the generalized Cartan-Hartogs domains Ω（μ, m）. The first result is that the natural Kahler metric gΩ（μ,m） of Ω（μ, m） is extremal if and only if its scalar curvature is a constant. The second result is that the Bergman metric, the Kahler-Einstein metric, the Caratheodary metric, and the Koboyashi metric are equivalent for Ω（μ, m）.展开更多
文摘In this paper we consider the extreme points of closed convex hull of the class T σ(p,α) and then it is used to determine the coefficient bounds. Some other interesting properties of the class T σ(p,α) are also investigated.
基金Project (No. 2004AA420100) supported by the National Hi-TechResearch and Development Program (863) of China
文摘When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.
基金This research is supported by the National Natural Science Foundation of China(Grant 10271073).
文摘In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem using the existing algorithms about them.
基金supported by the National Natural Science Foundation of China(No.11371257)
文摘Abstract In this paper, the author considers a class of bounded pseudoconvex domains, i.e., the generalized Cartan-Hartogs domains Ω（μ, m）. The first result is that the natural Kahler metric gΩ（μ,m） of Ω（μ, m） is extremal if and only if its scalar curvature is a constant. The second result is that the Bergman metric, the Kahler-Einstein metric, the Caratheodary metric, and the Koboyashi metric are equivalent for Ω（μ, m）.
