極小化法 的英文怎麼說

中文拼音 [jíxiǎohuàfǎ]
極小化法 英文
minimizing method
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. Maximum and minimum bounds may be placed on any unknown thickness or index of refraction

    全局解決方案/最優化方法用於獲得最好的解決方案，因此避免局部最小風險，極小化測量誤差
  2. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  3. This paper has proposed a method controlling iteration number and stability of solution according to thought of integral convergence algorithm minimizing nonlinear equations

    本文利用求非線性方程組極小化全局收斂法的思路，提出了控制迭代收斂次數、控制反演解穩定的方法。
  4. In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered at each replenishment

    此外，為達到極小化總訂購成本及總持有成本，本模型?用混合整?規劃技巧提供一個簡單求解方法，可同時求得最佳訂購次? 、訂購點及每次訂購? ? 。
  5. Secondly, to counter contour curve for large sole of rubber overshoes, the way of linear circle arc spline of two dimensions curve fitting has been raised in this paper and autocad has meanwhile been applied in cad / cam integeration system of rubber overshoes mould, and also a whole set of software and hardware technique developed, and the selecting way for optimizing tool path worked out. this way may make nc machining free running minimun

    其次，針對膠鞋大底的輪廓曲線，對圓弧樣條進行了深入研究，提出了二維曲線擬合的線性化圓弧樣條方法；同時將autocad應用於膠鞋模具cad / cam一體化系統中，成功地開發了一整套相應的軟硬體應用技術，提出了刀具軌跡優化的動態選擇法，以便使nc加工的空行程相對極小化。
  6. In view of the problem of three - phase flow interpretation, a method for applying grey theory and optimization technique to processing three - phase producing profile is presented

    該方法以滑脫模型為基礎，建立極小化目標函數及視流體速度（流量） 、密度、持水率、溫度和壓力等測量參數的理論響應方程。
  7. Solution of nonlinear ship motion equations in oblique regular seas. in this thesis, a new method is presented about calculating nonlinear ship motion responses in oblique seas based on minimized theory

    哈爾濱工程大學博士學位論文關于斜浪中非線性船舶運動方程的求解:本文提出了按極小化原理確定斜浪規則波中船舶非線性運動響應的新方法。
  8. Application of sumt and ga to solving constrained nonlinear programming problem

    序列無約束極小化技術和遺傳演算法在非線性規劃中的應用
  9. On the application of sumt and ga to solving constrained nonlinear programming problem

    序列無約束極小化技術和遺傳演算法在非線性規劃中的應用
  10. There have been many study about the unconstrained equivalent formulation. many algorithms and theories have been constituted about this kind of formulation. but to the constrained equivalent formulation, there is no corresponding algorithm

    無約束極小化變形的研究比較多，已經有了很多種演算法，理論上也相對完備，但對于約束極小化變形，據作者所知，至今還沒見過這方面的演算法。
  11. Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming. at first, we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3

    首先針對前兩章的對偶演算法由於需要精確求解一系列無約束極小化問題，因而實際計算中很難實現這一缺點，構造修正的對偶演算法，即，關于勢函數的無約束極小化問題無需精確求解的對偶演算法。
  12. In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems, one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio, another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan, we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1. 6

    第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。
  13. In this article, we consider the methods for solving nonlinear complementarity problems from two aspects : one is the equivalent formulation of minimization, the other is the equivalence formulation of equation. to the former, we give a new derivative - free descent algorithm based on constrained minimization formulation. to the later, we construct a new homotopy equation and give its algorithm

    在本篇論文中，我們從兩個方面考慮非線性互補問題的解決方法，一個是利用原始問題的極小化等價變形，給出了求解約束極小化問題的derivative - free下降演算法；另一個是利用方程形式等價變形，構造了新的同倫方程並給出了相應的演算法。
  14. Firstly, unlike the factorization - based methods that minimize the svd ( singular value decomposition ) re - projection error, the method uses the minimization of mean 2d re - projection error of projective points as a criterion, therefore it has a clearer physical meaning and enhances the accuracy of projective reconstruction results

    該方法以全局性極小化射影三維空間點的二維反投影誤差平方和為準則，相對于縮小svd反投影誤差的方法，具有更為明確合理的物理意義。
  15. Continuation method for non - linear l1 norm minimization problem

    1模極小化問題的路徑跟蹤演算法
  16. The deflated restarted total minimization backward perturbation method ( drtminback ) is presented. when solving the nonsymmetric linear systems, the paper makes the total backward perturbation analysis to qmr method, and uses the total quasi - minimal backward perturbation ( tqmback ) technique. so the restarted total quasi - minimal backward perturbation ( rtqmback ) method is given

    同樣地，對求解非對稱線性方程組的qmr方法作出了向後擾動分析，結合總體向後擾動范數擬極小化的技巧，給出了求解非對稱線性方程組的總體擬極小向後擾動（ tqmback ）方法。
  17. In chapter 2, we discuss the method for solving nonlinear complementarity problems with the equivalent formulation of minimization based on merit function

    第二章，我們集中討論了原始的非線性互補問題在經過merit函數的極小化變形之後的解決方法。
  18. Then, minimizing the performance by spectral factorization, we obtain an optimal controller design method, which can be used to take simultaneous account of model uncertainty and control energy constraint and evaluate optimal tracking performance and control energy in practical control system designs

    然後通過譜分解極小化該性能指標，導出一個最優的控制器設計方法，可以兼顧模型不確定性和控制能量約束，在實際控制系統設計中可用來對最優跟蹤性能和控制能量進行預估。
  19. Some heuristics for the problems are present, and their performance guarantee is analyzed by the transform lemma. some present results are improved. in part three, the problem of scheduling n jobs on a single ' batching machine is addressed, and the jobs have release times and due dates

    第三部分研究了單臺批處理機器，工件的到達時間不同，以極小化最大延遲時間為目標的分批排序問題1 | r _ j ， b | lmax ，論文提出了一些近似演算法，給出該了問題相應的最差性能比界。
  20. 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

分享到臉書