convex programming problem 中文意思是什麼

convex programming problem 解釋
凸規劃問題
  • convex : adj. 中凸的，凸圓的，凸面的。n. 凸狀，凸面，凸圓體。 convex glasses 遠視眼鏡，老花眼鏡。adv. -ly
  • programming : 編程序的
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. Abstract firstly, convert a programming problem with multiple constraints into a programming problem with single constraint, secondly, several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint, then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem

    摘要首先將一個具有多個約束的規劃問題轉化為一個只有一個約束的規劃問題，然後通過利用這個單約束的規劃問題，對原來的多約束規劃問題提出了一些凸化、凹化的方法，這樣這些多約束的規劃問題可以被轉化為一些凹規劃、反凸規劃同題。
  2. Basing on the statistical inaming t ' heory ( slt ), the thesis discusses the svm problems in linearly separable case, lineariy non - separable case and non - linear separable case, and induces a convex quadratic programming ( qp ) problem with an equation constrain and non - equation constrains. then one program on solving the op problem is proposed

    概述了統計學習理論的主要內容，推導了支持向量機方法在文本線性可分、線性不可分和非線性可分情況下實現分類的數學公式，將學習問題轉化為一個在等式約束和不等式約束下的凸二次優化問題，總結了求解的過程。
  3. Finally, prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem

    最後，還證明了得到的凹規劃和反凸規劃的全局最優解就是原問題的近似全局最優解。
  4. A controllable scheduling problem with discrete processing times using convex quadratic programming relaxation

    凸二次規劃鬆弛方法研究離散加工時間可控排序問題
  5. In nature, opf belongs to a kind of large scale nonlinear programming problem with equality and inequality constraints, having a non - convex, high - dimension and highly sparse characteristic

    Opf本質上屬於一個具有等式和不等式約束的大規模非線性規劃問題，具有非凸、高維數、高度稀疏的特性。
  6. In section one, based on theory of n dimensional euclid space, a new method labeled as " pointlineplane " recycling optimization algorithm is proposed to solve the linear programming problem. this algorithm is proposed on the basis of the thought as follovvs : as for three dimensional euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter

    第一部分內容是在n維歐氏空間理論的基礎上提出了一種求解線性規劃問題的新演算法? 「點線面」循環尋優法，本演算法是基於如下思想提出來的：我們知道，在三維歐氏空間中，線性規劃問題的可行域是一個由若干個平面圍成的廣義多面體，目標函數可以看作是以目標函數值為參變量的一個平行平面束。
  7. An interior point algorithm for convex quadratic programming problem with box constraints

    框式約束凸二次規劃問題的內點演算法
  8. In order to improve the efficiency of the algorithm, we not only correct some defects of the primal - dual interior point algorithm in [ 4 ], but also give a modified primal - dual interior point algorithm for convex quadratic programming problem with box constraints

    為提高演算法的有效性，對文[ 4 ]所給的原始-對偶內點演算法理論上的某些缺陷加以更正，並給出框式約束凸二次規劃問題的一個修正原始-對偶內點演算法。
  9. Convex programming problem

    凸規劃問題
  10. Secondly, according to convex geometric characteristics, a common - perpendicular - line algorithm is developed for the distance between the convex nurbs surfaces by making surfaces discrete, approximating the distance by one between convex hulls of discrete surfaces and solving a linear programming problem to get their vertical projective length on common perpendicular direction, that is, the original distance

    然後，針對凸曲面的幾何特徵，給出了nurbs凸曲面間距離求解的公垂線法和切平面法。公垂線法是把曲面間的距離求解問題轉化成曲面的離散點生成的凸殼間的距離，再歸之為兩凸殼在其公垂線上投影集合間的距離，由此抽象成一個線性規劃問題，估算出近點對。
分享友人
分享到 Line

分享到臉書