支撑超平面 meaning in Chinese

supporting hyperplane

This paper consists of three parts as follows , 1 . a nonsmooth convex programming is relaxed to a smooth convex programming by using a cutting - plane , which is constructed by subgradient . an algorithm based on the cutting - plane is presented . in this way , a cutting plane algorithm and it ' s convergence for semide ? nite programming are provided
利用次微分的概念给出了一种非光滑凸规划割平面的构造技巧，找到了半定规划可行域的一个支撑超平面，从而给出了求解半定规划的一种割平面算法