cutting plane algorithm 中文意思是什麼

cutting plane algorithm 解釋
割平面法
  • cutting : n 1 切斷,切下;切片;【園藝】扦插,插條;〈英國〉剪裁,(報紙等的)剪輯;(寶石等的)加工,琢磨...
  • plane : n 懸鈴木屬樹木。n 1 平面,水平面,面。2 (知識等的)發達程度,水平,階段。3 【航空】機翼面;〈常 ...
  • algorithm : n. 【數學】演算法;規則系統;演段。
  1. As an application of succeeding, a numerical example of max - cut is given. 3. several semidefinite relaxation detection strategies of the cdma maximum likelihood multiuser detection are investigated. rounding, coordinate descent, cutting plane and branch and bound based on quadratic programming algorithm are presented to get the suboptirnal solution

    本文紿出了基於半定規劃模型尋求多用戶檢測問題次優解的幾種重要方法,包括隨機擾動法、坐標下降法、半定規劃的割平面法和二次規劃的分枝定界法等
  2. 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

    利用次微分的概念給出了一種非光滑凸規劃割平面的構造技巧,找到了半定規劃可行域的一個支撐超平面,從而給出了求解半定規劃的一種割平面演算法
  3. A strength relaxation of semidefinite programming for standard quadratic optimization problems is given. the relaxation is transformed to a semi - indefinite programming. a linear programming cutting plane algorithm is proposed

    3 .給出標準二次優化問題的一個強化半定規劃鬆弛模型,把該模型轉化為半不定的線性規劃問題,並提出線性規劃的一種新的割平面演算法解該問題,理論和數值實驗證明了演算法的有效性
分享友人