最優梯度法 的英文怎麼說

中文拼音 [zuìyōutīdùfǎ]
最優梯度法 英文
optimized gradient method
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 梯 : Ⅰ名詞1 （梯子; 樓梯） ladder; stairs; steps; staircase 2 （姓氏） a surname Ⅱ形容詞（形狀像樓梯的...
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  1. Methods 1 ) statistic methods including factorial experiment was carried out to optimize the major conditions for sample management, and the feasible negative and positive control for fcm analysis of cd62p expression were check out

    方法1採用濃度梯度法優化gprp濃度條件，採用析因設計優化凝血酶濃度和37孵育時間條件，尋找最佳陰、陽性對照。
  2. The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong

    這種混合優化演算法結合了共扼梯度法和最速下降法產生搜索方向，既提高了共扼梯度演算法的收斂速度，又解決了目標函數的等值線是扁長橢球時，最速下降法下降緩慢的問題，具有收斂速度快、收斂范圍大、適應面廣等特點。
  3. This article puts forward a solution named divide - assemble by deducing the size of bp neural network to overcome entering the local best point, the dividing process is that a big bp neural network is divided into several small bp neural networks, every small bp neural network can study alone, after all small bp neural networks finish their study, we can assemble all these small bp neural networks into the quondam big bp neural networks ; on the basis of divide - assemble solution, this article discusses the preprocessing of input species and how to deduce the size of bp neural network further to make it easy to overcome entering the local best point ; for the study of every small bp neural network, this article adopts a solution named gdr - ga algorithm, which includes two algorithms. gdr ? a algorithm makes the merits of the two algorithms makeup each other to increase searching speed. finally, this article discusses the processing of atm band - width distribution dynamically

    本文從bp網的結構出發，以減小bp神經網路的規模為手段來克服陷入局部極小點，提出了bp神經網路的拆分組裝方法，即將一個大的bp網有機地拆分為幾個小的子bp網，每個子網的權值單獨訓練，訓練好以後，再將每個子網的單元和權值有機地組裝成原先的bp網，從理論和實驗上證明了該方法在解決局部極小值這一問題時是有效的；在拆分組裝方法基礎上，本文詳細闡述了輸入樣本的預處理過程，更進一步地減小了bp網路的規模，使子網的學習更加容易了；對于子網的學習，本文採用了最速梯度? ?遺傳混合演算法（即gdr ? ? ga演算法） ，使gdr演算法和ga演算法的優點互為補充，提高了收斂速度；最後本文闡述了用以上方法進行atm帶寬動態分配的過程。
  4. A conjugate gradient method based on subset of subspace

    基於子空間子集最優的共軛梯度法
  5. One is the bss based on kernel density estimation ( kde ) and genetic algorithm ( ga ), the other is the blind deconvolution based on high order cross cumulants and ga. without nlf, the performance of separation in both algorithms is independent with the kurtosis of the sources

    兩種演算法的實現無需引入非線性函數，因此都與源信號的峭度性質無關;另外，選取全局搜索的遺傳演算法進行尋優，避免了梯度法搜索的局部性，使得演算法均能收斂到問題的全局最優解。
  6. This method is of high reliability and efficiency. it ' s regarded the one of the best designing method nowadays. to choose the best parameter of frication piece and make sure that the cloth ' s mechanical function is the aim of friction piece ' s parameter priority

    為了圓滿解決上述兩個問題，本文採用廣義既約梯度法對摩擦片參數、變速器傳動比及變速器二軸六檔齒輪進行了優化設計，該演算法可靠性和效率都很高，是目前公認最為優秀的優化方法之一。
  7. Among hese method, one of the simplest is the deepest gradient descent algorithm, but it has one disadvantage that the solutions are oscillatory and slowly convergent. a friction term is ntroduced to avoid oscillatory solutions and raise convergence rate. the third major contribution of this dissertation is study on 3 - d diffuse object surface optical automatic measurement

    其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。
  8. As for single objective optimization algorithm, a fast iterative algorithm based on conjugate gradient algorithm is presented, which makes use of extent limit of iterative optimization step in conjugate gradient with the idea of least square

    在標量優化圖像重建法中，作者以最小二乘為目標，利用共軛梯度法中迭代最優步長的區間性，提出了一種基於共軛梯度法的快速迭代演算法。
  9. Optimal periodic control with the lowest operational cost by limiting total substrate discharge mass was studied. through adding new state variable and using supplement functions, the problem with restriction conditions was converted into nonrestriction problem. in addition, the dynamic searching method of optimal step coefficient was developed to modify the conventional gradient method, consequently the calculation problem of the multivariable optimal periodic control was able to be resolved better. it was found that the operational costs of optimal control under various initial states are distinctly different. a new concept of optimal control under optimal initial state was presented. it is pointed out emphatically that to the treatment system without optimal control condition, the suboptimal control with extensive practical value can be realized according to the results of optima control

    著重研究了在限制有機物排放總量時，使其運行費用最低的最優周期控制問題.通過增加新的狀態變量和用補償函數法，將本課題的有約束條件問題化為無約束條件問題，並提出了最優步長參數的動態搜索法來修改傳統的梯度法，從而較完善地解決了多變量最優周期控制的計算問題.研究中還發現了不同初始條件下最優控制所需要的運行費用也大不相同，進而提出了最優初始狀態下最優周期控制的新概念，這對保證出水質量的同時進一步降低污水處理成本來說具有更重要的意義.本文還強調指出：對于尚不具備實現最優控制條件的處理系統，可根據最優控制的研究結果實現具有廣泛實用價值的準最優控制
  10. In the course of modeling, we present multi - step generalized gradient method and multi - stage curve fitting technique, prove convergence of multi - step generalized gradient method by using differential equation stable theory, analyze the error of multi - stage curve fitting technique by using inner space, creat knowledge base of water network system by using the maximum subordinate principle of and near - select principle of pattern recognition. at last we make the optimal running scheme of water network system based on heuristic search technique of artificial intelligence and global feedback immediate coordination method of large scale system theory

    在建立系統模型的過程中，提出了多步廣義梯度法和多層曲線擬合的建模方法，並用微分方程穩定性理論證明了多步廣度梯度法收斂性，用內積空間的有關知識對多層曲線擬合進行誤差分析;應用模糊數學中的最大隸屬度原則和模糊識別中的擇近原則和人工智慧中狀態空間表示法建立注水系統的知識庫;用人工智慧中的啟發式搜索技術和大系統理論中的具有全局反饋的直接協調法制定注水系統的優化運行方案。
  11. A full mathematical model of optimal flow pattern design withengineering constraints was put forward, based on modern optimal control theory. an optimal flow pattern design was presented for optimizing meridional channel of axial flow turbine. according to integral optimization of turbine stages, a full physical model and mathematical expression were put forward for proposition of optimal flow pattern, including all performance parameters in turbine stages. this problem was further recast into a typical form control to maximize specific performance index such as work or efficiency of stage with given initial state, fixed terminal condition and constraints for part of state terminal variables. the program was also worked out according penalty function method and conjugate gradient method. the optimal distribution of c1ur1 ( r1 ) was obtained according to constraint conditions and maximized objective function

    把近代最優控制論方法引入軸流透平葉片的設計，在優化的軸流透平子午通道內，建立包括透平級內所有性能參量的最優流型命題的完整的物理模型及其數學表達式，並歸化為一個在給定初始狀態、自變量終端固定、部分狀態變量終端受有約束的條件下，使級的某一性能指標（如級的功率）達到最優的最優控制問題，應用「代價函數法」及「共軛梯度法」編制計算程序，計算得到符合給定約束條件、並使目標函數取極值的最優環量分佈，結果是令人滿意的。
  12. The aim of this paper is to construct a three - term conjugate gradient method to solve the trust region subproblem

    在本文中，我們提出了解信賴域子問題的三項預處理共軛梯度法，並將這個方法嵌入解大型最優化問題的信賴域演算法中。
  13. For solving nonlinear optimization problems, newton method is one of the most efficient methods. as modification to newton method, inexact newton methods are popular for solving the middle and large scale noniinear optimization problems. among them, cf - pcg ( newton - pcg ) method is an efficient improvement to newton method

    在非線性最優化的研究中，牛頓法是二階演算法，對牛頓法的改進，一直是人們關注的問題，近年來，用共軛梯度法對它進行改進，即研究牛頓- pcg型方法是國內外的一個研究熱點。
  14. At last with the prototype of the vertical - axis cycloid turbine, the optimal method and its mathematical model based on conjugate gradient method are presented in order to enhance the energy conversion coefficient. such optimal results as the energy conversion and the relation between attack angle and azimuth angle are given with particular analysis to sum up the reason of the improved performance of the turbine

    最後以豎軸直葉擺線式水輪機為優化原型，提出了一種水輪機水動力性能的優化計算方法，建立了數學模型，運用共軛梯度法進行優化設計，以提高水輪機的能量利用率為目標，給出了優化的葉片攻角變化規律、能量利用率結果，探討了能量利用率提高的原因。
  15. Based on the theory of mechanical optimization and finite element analysis, elbow - bar mechanism of the mp1040b moulding machines made by beiren group is investigated in the dissertation. firstly, a kinematic model representing the bar mechanism is built and the nonlinear system of equations is solved through the method of gradient. meanwhile, the angular displacement, angular velocity, angular acceleration and the corresponding curves of each component in a motion period are obtained

    本文以北京人民機器廠mp1040b型模切機肘桿機構為研究對象，以機械最優化理論和有限元技術為基礎，首先對模切機肘桿機構建立數學模型，通過梯度法求解此非線性方程組，並得出機構在一個運動周期中各構件的角位移、角速度、加速度等運動參數及曲線。
  16. Natural gradient is a new optimization way that is proposed in a special space ? riemannian space. the parameter space in blind source separation is riemannian space. natural gradient has many better characters compared with normal gradient

    自然梯度下降法是一種新的最優化方法，自然梯度下降法是在黎曼空間下提出的，自然梯度相比于標準梯度有很多優點。
  17. This paper is devoted to some numerical optimization methods and optimization models for solving practical problems in real world. the methods we concern with are the conjugate gradient algorithms, evolutionary algorithms and goal programming

    本文對近年來備受關注的幾類最優化方法（共軛梯度演算法、進化演算法和目標規劃法）的理論性質及應用進行了研究，主要研究成果如下： 1
  18. And with the results of calculation obtained by the first - order gradient algorithms which is initial value of the neighboring extremal algorithms we can transform the problem into a face to point one, then a good result is attained by the neighboring extremal algorithms. in the end, the course of orbit transfers is depicted

    利用梯度法對兩點邊值問題進行計算，將面對面的問題轉化為一個點對點問題，將所得結果作為鄰近極值法的初始值並進行精確計算。最後，描繪了最優變軌過程。
  19. The real - time obtainment of the components of projection matrix and the substitution of constant step for optimal step in the one - dimension search in conjugate gradient were adopted to ensure the equality of reconstructed image from incomplete projections and shorten the reconstruction time simultaneously

    通過即時獲取投影矩陣分量，以固定步長替代共軛梯度法中一維搜索最優迭代步長，在確保品質的同時縮短重建時間。
  20. On the other hand, with traditional iterations and the conjugate gradient ( cg ) as smoothers, we can show the optimal convergence rate of the cascadic method in energy norm for 1 - d and 2 - d cases. when the mesh level is arbitrary, we use a duality argument and obtain the quasi - optimality of the algorithm only for 2 - d problems

    另一方面，採用傳統迭代子和共軛梯度法作為光滑子，我們證明了瀑布型多重網格法對一、二維非線性橢圓邊值問題，在能量范數下，均可獲得最優收斂階。
分享友人
分享到 Line

分享到臉書