迭代優化技術 的英文怎麼說

中文拼音 [diědàiyōuhuàjìshù]
迭代優化技術 英文
iterative optimization technique
  • 迭 : Ⅰ動詞（輪流; 替換） alternate; change Ⅱ副詞1 （屢次） repeatedly; again and again 2 （及） in tim...
  • 代 : Ⅰ動詞1 （代替） take the place of; be in place of 2 （代理） act on behalf of; acting Ⅱ名詞1 （歷...
  • 技 : 名詞（技能; 本領） skill; ability; trick; technique
  • 術 : 術名詞1. （技藝; 技術; 學術） art; skill; technique 2. （方法; 策略） method; tactics 3. （姓氏） a surname
  1. On one hand, from the technique of constrained least squares and limited energy of additive noise, an effective restored approach by adopting regularization method to overcoming ill - posed problem, solving an equation with a single variable, and using space iterative algorithm is proposed ; on the other hand, aiming at the restoration of blurred image, another effective restoration approach based on least - square algorithm is also proposed in this paper. this method firstly adopts increment iterative algorithm to improve convergence and meanwhile applies regularization technique to overcome ill - posed problem. in the computations, the regularized parameter has its adaptive character, which can be determined in terms of the restored image at each iteration step therefore automatically correct to the appropriate value

    一是從約束最小二乘出發，在加性噪聲能量有界的前提下，採用正則化方法來克服病態問題，通過解一個單變量方程，並利用空域迭代運算實現了一種有效的圖像復原;二是針對模糊圖像的復原問題，從最小二乘演算法出發，採用增量迭代的方法改善演算法的收斂性，同時結合正則化技術克服問題的病態性質，並引入自適應的正則化參數，使其與圖像復原的迭代運算同步進行並自動修正到最優值。
  2. For problems whose objective function or constraint functions have sharp curves on their contour maps ( such as the rosenbrock ' s function which has banana shape contours ), monotonicity may cause a series of very small steps, causing a huge number of iteration to reach their solutions. by using the nonmonotone technique, we get the sequence of successful interative point which should make the objective function mono - tonically decreasing. hence, we use both trust region strategy and line search technique and make each iterate generate an acceptable trial step in interior feasible set as next interative point

    我們利用非單調技術得到使目標函數非單調下降的迭代點，因為非單調克服高度非線性化函數的求解問題，從而避免了只使用單調搜索在「峽谷」現象局部最優解被卡的情況，我們用信賴域策略和非單調線搜索技術相結合的方法，使演算法產生的迭代步落在可行域內點，同時又在信賴域內滿足接受準則。
  3. 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

    傳統的基於聚類準則的聚類演算法本質上是一種局部搜索演算法，它們採用了一種迭代的爬山技術來尋找最優解，存在著對初始化敏感和容易陷入局部極小的致命缺點。
  4. The main contributions of this dissertation are summarized as follow : ( 1 ) an ilc approach combining feedforward with current feedback is developed based on optimal feedback control and the gradient method. a sufficient condition that guarantees the convergences is given for linear system. the procedures of designing the algorithm can employ lqr, h2 or h approaches to improve the convergence rate of learning in iterations

    本文的主要成果有： 1 、在開閉環綜合迭代學習控制結構的基礎上，分析了利用梯度下降法設計前饋迭代學習控制器時，為保證演算法的收斂性，閉環控制系統應該滿足的充分條件，並依據提高演算法收斂速率的優化條件，給出了基於lqr 、 h _ 2和h等優化控制技術的迭代學習控制演算法的設計方法。
  5. In conjugate gradient optimization algorithm, the continuous and digital models of an imaging system are defined to explain image acquisition, the image registration algorithm and the conjugate gradient reconstruction algorithm are designed

    在共軛梯度最優化迭代演算法中，對相機模型、圖像微位移和微旋轉角精確配準、共軛梯度重建等關鍵技術進行了研究。
  6. Then, the cutting - stock technology in the product design system oriented to the optimized utilization of material resource is deeply studied. in this paper, the mathematics model of two - dimensional guillotine cutting - stock problem based on inventory is set up. to solve the mathematics model above, the iterative solving method through wiping off worse layout is put forward ; on the base of the column generation formulas that are deduced to solve multi - material two - dimensional guillotine cutting - stock model ， the column generation algorithm is brought forward by using column generation technology ; the solution of two - dimensional knapsack problem and one - dimensional knapsack problem is studied ; the concept of the value of

    給出了基於庫存的二維guillotine優化下料問題的數學模型，提出了一種新的求解方法? ?去差迭代求解法；引入了列生成技術，在推導多原材二維guillotine優化下料模型求解的列生成數學形式的基礎上，給出了列生成迭代求解演算法，研究並分析了二維背包問題和一維背包問題的求解演算法；提出了板材排樣價值概念，建立了板材排樣價值的估計方法；論文同時針對優化下料技術當前應用中存在的問題，提出了一種基於asp （ applicationservicesprovider ）模式的多軟體協同優化下料解決方法並給出了該方法基於agent思想的具體實現技術。
  7. Before the optimization modeling, the scaling step technique is used to adjust the structural behavior, and the stability of computational convergence is ensured

    在每一步迭代過程建立優化模型之前，採用射線步技術，調整了結構的性態，保證了收斂的穩定性。
  8. The final design result can be found after iterations. before the optimization modeling, the scaling step technique is used to adjust the structure behavior, and the stability of computational convergence is guaranteed

    其中，在每一步迭代過程建立優化模型之前，採用射線步技術，調整了結構的性態，保證了收斂的穩定性。
  9. The explicit method is widely used for its simpleness and little memory consumed with local time step and variable coefficients implicit residual smooth to accelerate the convergence procedure. according to yoon and jameson ' s ideas, an efficient implicit lu - sgs algorithm is carefully constructed by combing the advantages of lu factorization and symmetric - gauss - seidel technique in such a way to make use the l and u operators scalar diagonal matrices, thus the numeric algorithm requires only scalar inversion. the computational efficiency is greatly improved with this scheme

    顯式方法具有簡單，消耗內存小等優點，並採用當地時間步長、變系數隱式殘值光順等加速收斂措施，在定常流動的模擬中得到了廣泛的應用;根據yoon和jameson提出的簡化正、負矩陣分裂，構造的l 、 u運算元只需進行標量對角陣求逆，極大提高了流場數值求解過程的計算效率;採用newton類型的偽時間子迭代技術使時間推進精度提高至二階。
  10. Otherwise, the trust region radius is reduced and a new trial point is selected. it is possible that the region subproblem need to be resolved many times before obtaining an acceptable step, and hence the total computation for completing one iteration might be expensive. this article combines approximate trust region path and nonmonotonic backtracking strategy to solve nonlinear optimization subject to linear inequality constraints, that is, we use approximate trust region path to get the research direction by minimuming quadratical model in the trust region by employing

    本文在求解線性不等式約束優化問題時，將近似信賴域路徑與非單調信賴域方法相結合，即在信賴域半徑內沿近似信賴域路徑得到一極小化二次模型的搜索方向後採用回代法避免重復求解信賴域子問題，在此演算法中當搜索方向不被接受時，就用非單調線搜索技術得到接受步長，定義新的迭代點。
分享友人
分享到 Line

分享到臉書