convex programming meaning in Chinese
凸规划
凸形规划法
Examples
- The generalized support vector machines ( gsvms ) was proposed by mangasarian , but it can not be degenerated to the standard svms . in fact , the former only consider the strict convex programming , while the latter considers the convex programming
Mangasarian提出广义支持向量机，但不包含标准的支持向量机：前者研究一般的严格凸规划问题，而后者针对的是特定的凸规划问题。 - At the beginning of their research , they could transform some nonlinear programming into relevant dual , such transformation made some outcome almost similar to linear programming . but if they wanted meaningful results , they had to consider convex programming
在初期，他们发现可以将某些非线性规划表述为一个相应的对偶规划，且有少量相似于线性规划的结果，但如果希望得到有意义的结果，只能考虑凸规划。 - The paper discusses convex programs with an additional reverse convex constraint and gives the properties of the global optimization about this problem . a branch - and - bound algorithm for solving this problem is constructed and the convergence properties of this algorithm is analysed
讨论带一个反凸约束的凸规划问题.给出了整体最优解的特性，利用此特性借助分枝定界方法，构造出求该问题整体最优解的算法，并进行了收敛性分析 - In the progress of deducing the dual of these two problems using the knowledge of convex programming and generalized fenchel theory , you can find lagrange dual of the two programming by lagrange dual in nonlinear programming in this article
基于凸规划知识和广义的fenchel定理，作者推导出这两类问题的凸对偶规划。同时，发现由非线性规划中lagrange对偶可以获得这两类问题的lagrange对偶规划，且推导过程中没有涉及很深的数学知识，使得应用更为广泛。 - 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
利用次微分的概念给出了一种非光滑凸规划割平面的构造技巧，找到了半定规划可行域的一个支撑超平面，从而给出了求解半定规划的一种割平面算法