1) near convexlikeness
近类凸
2) near subconvexlikeness
近次类凸
3) near-subconvexlikeness
近似次类凸
4) nearest neighbor convex hull classifier
最近邻凸包分类
1.
Face recognition using wavelet transform and nearest neighbor convex hull classifier;
基于小波和最近邻凸包分类器的人脸识别
5) Nearly cone-subconvexlike
近似锥-次类凸
1.
Moreover,under the assumption of nearly cone-subconvexlikeness,the necessary and su?cient conditions for a strictly efficient solution being a generalized saddle point in set-valued optimization problems with maps are obtained.
利用广义鞍点的性质和凸集分离定理,得到了广义鞍点的一个集分离性质,并且在近似锥-次类凸假设下建立了集值优化问题严有效解为广义鞍点的充分条件和必要条件。
2.
Results The property of generalized saddle point with cone separation was prved and the conditions of super efficient solutions being the generalized saddle point in the nearly cone-subconvexlike vector optim.
结果得到广义鞍点的一个锥分离性质,并且建立了近似锥-次类凸集值向量优化问题超有效解为广义鞍点的条件。
6) nearly cone-subconvexlikeness
近似锥-次类凸
1.
Under the assump- tion of nearly cone-subconvexlikeness,by applying alternative theorem,a Kuhn-Tucker optimality necessary condition for(VP)is derived,by using scalarization theorem,a suf- ficient condition is also obtained.
在近似锥-次类凸假设下,利用择一性定理得到了Kuhn-Tucker型最优性必要条件,利用标量化定理得到了Kuhn-Tucker型最优性充分条件。
2.
By applying separation theorem for convex sets,the Kuhm-Tucker necessary condition is derived for (VP) to attain its strongly efficient solution,under the assumption of nearly cone-subconvexlikeness,the sufficient condition is also presented.
在近似锥-次类凸假设下,得到了(VP)取得强有效解的充分条件。
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条