約束極小化 的英文怎麼說

中文拼音 [yāoshùjíxiǎohuà]
約束極小化 英文
constrained minimization
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. 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

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  2. The high entropy of the real and imaginary parts of sar raw data makes lossless - coding compression techniques unfit for sar raw data. in chapter 4, some compression algorithms for sar raw data compression, such as baq, upq, bavq and wt - subbandcade are analyzed and discussed. an improved unrestricted polar quantizer ( upq ), which can enhance the performance of the quantizer is put forward

    第四章分別對塊自適應量化（ baq ）演算法、非約束式極坐標量化（ upq ）演算法、塊自適應矢量量化（ bavq ）演算法和小波變換子帶編碼演算法進行了分析和研究，並詳細討論了這些演算法在工程實際中的應用。
  3. Also, the author ’ s design strategy and creativity has been given in this paper. specifically, it includes : based on the feasibility analysis of the fit selection of control parameters in the aeration process, the aeration process of wastewater treatment of the joint - constructional complete - mixed activated sludge process has been aimed at in this paper. then, the state equations of the aeration process have been proposed in this paper, which is on the base of dissolved oxygen concentration ( do ) and discharge quantity of sludge ( qw ) as control variables, the concentration of bod and sludge as state variables. based on the present study on optimization control of wastewater treatment, the multivariable optimal control model with restriction factor has been presented in the paper with introducing modern control theory and system analysis into the field of activated sludge wastewater treatment,

    具體包括:以完全混合、表面曝氣合建式活性污泥工藝的污水處理曝氣過程為研究對象，在闡述了曝氣過程式控制制參數選取可行性的基礎上，建立了以溶解氧濃度do和活性污泥排放量qw為控制變量，以曝氣池中有機物濃度s和微生物濃度x為狀態變量的活性污泥曝氣過程的基本狀態方程;運用現代控制理論的觀點和污水處理理論，在現有關于污水處理最優控制問題研究的基礎上，建立了有約束條件多變量能耗最小數學模型，該數學模型是以有機物排放總量和狀態變量的末值條件作為約束條件，曝氣過程的能耗最小作為目標泛函;採用增廣拉格朗日乘子法對最優控制問題進行轉化，並對應用極大值原理求解能耗最小這一最優控制問題進行了詳細的解析;引入約束運算元，應用具有控制約束的共軛梯度演算法對能耗最小這一最優控制問題進行求解，並進行模擬實驗驗證。
  4. This paper established optimization mathematical models with the structural reliability constraints based on the structural reliability analysis. in this paper, truss and beam structures are studied as the research objects and the structural elements cross sectional areas as the design variables

    在結構可靠性分析的基礎上，構建了以桿、梁截面積為設計變量，使結構重量極小化為目標函數，同時具有應力和位移可靠性約束的優化設計數學模型。
  5. Based on finite element and general reliability analysis, the structural optimization design model based on probability is constructed, which refers the cross - section areas as the design variables, refers the minimum of the frame ’ s weight as the object with the reliability restricts of stress and displacement

    在結構廣義可靠性分析的基礎上，構建了以桿截面積為設計變量，使結構重量極小化為目標函數，同時具有應力和位移廣義可靠性約束的優化設計數學模型，並將其應用於天線結構的優化設計之中。
  6. Application of sumt and ga to solving constrained nonlinear programming problem

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

    序列無約束極小化技術和遺傳演算法在非線性規劃中的應用
  8. It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function

    我們知道，通過廣義d -間隙函數，可以將變分不等式問題轉化為一個無約束極小化問題。
  9. 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

    無約束極小化變形的研究比較多，已經有了很多種演算法，理論上也相對完備，但對于約束極小化變形，據作者所知，至今還沒見過這方面的演算法。
  10. 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

    首先針對前兩章的對偶演算法由於需要精確求解一系列無約束極小化問題，因而實際計算中很難實現這一缺點，構造修正的對偶演算法，即，關于勢函數的無約束極小化問題無需精確求解的對偶演算法。
  11. By intro - ducing a penalty function as the following, for every e > 0, we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem. the solutions of such a sequence of unconstrained minimization problems all exist, and they converge to the solution of the constrained minimization problem in a certain sense

    這列無約束極小化問題（ p _ ）的解都是存在的，並且在某種意義下收斂至原始約束極小化問題（ p ）的解，不僅如此，它們的性能指標也收斂至原始問題（ p ）解的性能指標。
  12. In unconstrained optimization, we deal with the standard problem of finding the minimum of a function f : rn - r. if we assume that the function is twice continuously differentiable, many methods can be applied to find the minimum

    在無約束最優化中，考慮尋找f ： r ~ n r的極小點。假設f是二次連續可微的，可以有許多方法尋找它的極小點。
  13. To the inequality constrained least squares adjustment problem, this paper converts many inequality constraints into one equality constraint by using aggregate function of non - linear programming ; a basic augmented lagrangean algorithm can obtain the solutions for equality constrained non - linear programming problem and the solutions are identical to those obtained by the bayesian method and / or simplex algorithm

    摘要對不等式約束最小二乘平差問題，藉助非線性規劃中的凝聚約束方法把多個不等式約束轉化為一個等式約束，採用拉格朗日極值法求解，解與貝葉斯解或單純形解一致。
  14. This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems

    本文主要研究非線性優化中的一類對偶演算法，包括無約束極大極小問題的對偶演算法和約束非線性規劃問題的一類對偶演算法的理論與相應的數值實現。
  15. In this chapter, we consider the method of constrained equivalent formulation. we use the merit function based on the restrained ncp function and convert the origin problem ncp ( f ) to minimization problem which constrained on rn +

    我們在這一章里就考慮了ncp （ f ）的約束極小化變形，通過限制的ncp函數來構造ncp問題的merit函數，將原始的問題ncp （ f ）轉化為（
  16. 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下降演算法；另一個是利用方程形式等價變形，構造了新的同倫方程並給出了相應的演算法。
  17. With merit function, the origin problem can be conformed to unconstrained or constrained minimization problems

    利用merit函數的極小化變形可分為無約束和約束兩種類型。
  18. We apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems

    用這些演算法計算大量的規模不是很大的不等式約束優化問題，無約束極大極小問題，一般約束優化問題，數值結果表明它們是有效的
  19. 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

    然後通過譜分解極小化該性能指標，導出一個最優的控制器設計方法，可以兼顧模型不確定性和控制能量約束，在實際控制系統設計中可用來對最優跟蹤性能和控制能量進行預估。
  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

分享到臉書