iterative optimization technique 中文意思是什麼

iterative optimization technique 解釋
迭代優化技術
  • iterative : 迭代的
  • optimization : n. 最佳化，最優化。
  • technique : n. 1. （專門）技術；（藝術上的）技巧，技能。2. 手法〈如畫法，演奏法等〉。3. 方法。
  1. Conventional clustering criteria - based algorithms is a kind of local search method by using iterative mountain climbing technique to find optimization solution, which has two severe defects - sensitive to initial data and easy as can get into local minimum

    傳統的基於聚類準則的聚類演算法本質上是一種局部搜索演算法，它們採用了一種迭代的爬山技術來尋找最優解，存在著對初始化敏感和容易陷入局部極小的致命缺點。
  2. In the computational methods of tpbvp, in order to reduce some difficulties involved in solving a tpbvp via adjoint variables, we discuss a direct method in which state and control variables are indirectly parameterized, the method employs a recently developed direct optimization technique that uses a piecewise polynomial representation for the state and control variables, thus converting the optimal control problem into a nonlinear programming problem, which can be solved numerically. it makes the initial iterative variable more easy to be determined

    在數值解法中，為了減少解決兩點邊值問題共軛變量帶來的困難，主要討論了將狀態變量和控制變量進行參數化的一種直接方法，這種方法採用了近段發展起來的使用分段的多項式來代替狀態和控制變量的直接優化方法，然後最優控制問題就轉化成可以用數值方法解決的非線性規劃問題，使得迭代初值更加容易選取。
  3. The solution methods of support vector machine, including quadratic programming method, chunking method, decomposing method, sequential minimization optimization method, iterative solution method named lagrange support vector machine based on lagrange function and newton method based on the smoothing technique, are studied systematically

    主要有支持向量機的二次規劃求解法、選塊法、分解法、序列最小優化方法、基於lagrange函數的迭代求解方法即lagrange支持向量機、基於smoothing處理的牛頓求解方法。
分享友人
分享到 Line

分享到臉書