The Identification of Convex Function on Riemannian Manifold

The necessary and sufficient condition of convex function is significant in nonlinear convex programming. This paper presents the identification of convex function on Riemannian manifold by use of Penot generalized directional derivative and the Clarke generalized gradient. This paper also presents a method for judging whether a point is the global minimum point in the inequality constraints. Our objective here is to extend the content and proof the necessary and sufficient condition of convex function to Riemannian manifolds.