等式約束 的英文怎麼說

中文拼音 [děngshìyāoshù]
等式約束 英文
equality constraint
  • 等 : Ⅰ量詞1 （等級） class; grade; rank 2 （種; 類） kind; sort; type Ⅱ形容詞（程度或數量上相同） equa...
  • 式 : 名詞1 （樣式） type; style 2 （格式） pattern; form 3 （儀式; 典禮） ceremony; ritual 4 （自然科...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 等式 : [數學] equation; equality等式約束 equality constraint; 等式組 equality system
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. A nonmonotonic criterion is used to speed up the convergence progress in some ill - conditioned cases

    既約hesse演算法是目前較流行的解決非線性等式約束優化問題的有效方法之一。
  2. First, the nonlinear ls problem without constraint is converted to that subjected to inequality constraints by putting constraints on the do as of the received signals and toas of the first arrived signal with geometrically based single - bounce ( gbsb ) statistical channel model and cost - 207 model. then, a penalty function is used in the estimation of ms position

    首先，用基於幾何結構的單次反射圓模型和cost - 207模型，對期望定位用戶的各條多徑信號的波達方向和最先到達多徑信號的時間進行約束，將傳統的解無約束的非線性最小二乘定位問題或近似線性最小二乘定位問題轉化為解不等式約束的非線性最小二乘定位問題；然後，用內點罰函數法估計移動臺的位置。
  3. In this thesis, the optimality sufficiency conditions and duality theory are discussed in multiobjective nonlinear programming involving ( f, a, p, d ) - convexity and generalized ( f, a, p, d ) - convexity. at that time, an algorithm is discussed for nonlinear multiobjective problem

    本文主要討論了（ f ， ， ， d ） -凸及廣義（ f ， ， ， d ） -凸條件下非線性多目標規劃問題的最優性充分條件和對偶理論，同時，也探討了求解具有線性等式約束的非線性多目標規劃問題的一種新演算法。
  4. The feasible area for this kind of programming changes into boundary, and there is no interior point

    當規劃問題為混合約束（帶有等式約束）時，可行域變成一個邊界區域，並沒有內點。
  5. This optimizing method had been used successfully in full - scale aircraft testing. 6 ) in the global equilibrating, a modified lagrange multiplier method had bring forward. this method can solve inequality constrained optimizer problems

    在整體平衡中，提出了改進的拉格朗日乘數法，成功地解決了含不等式約束條件的優化問題，該方法具有計算簡單，收斂速度快等特點。
  6. Basing on the statistical inaming t ' heory ( slt ), the thesis discusses the svm problems in linearly separable case, lineariy non - separable case and non - linear separable case, and induces a convex quadratic programming ( qp ) problem with an equation constrain and non - equation constrains. then one program on solving the op problem is proposed

    概述了統計學習理論的主要內容，推導了支持向量機方法在文本線性可分、線性不可分和非線性可分情況下實現分類的數學公式，將學習問題轉化為一個在等式約束和不等式約束下的凸二次優化問題，總結了求解的過程。
  7. Optimum design for double - horse head beam pumping unit is a question of non - linear programming with inequality constraint condition and multi - objective function

    雙驢頭抽油機優化設計是一個具有不等式約束多目標函數的非線性規劃問題。
  8. On a class of quadratic programming problem with equality constraints

    一類帶有等式約束的二次規劃問題
  9. Linear equality constraints

    線性等式約束
  10. An interval algorithm for problems of nonlinear equality constrained global optimization

    非線性等式約束全局優化問題的區間演算法
  11. The method can be applied to the transportation problem with fuzzy equality constraints

    用該方法求解了具有模糊等式約束的運輸問題。
  12. Descending dimension algorithm for multi - objective programming with linear equality constraints

    線性等式約束多目標規劃的一個降維演算法
  13. A global optimization algorithm for solving nonlinear programming problem involving many equality constraints

    含有等式約束非線性規劃的全局優化演算法
  14. In this thesis we propose a scaling trust region interior point algorithm for linear constrained optimization subject to bounds on variable

    本文將提出一種仿射變換的信賴內點演算法解決變量有界的線性等式約束優化問題。
  15. So those eight parameters are selected as design - variables in mathematics optimum design. the restriction condition has fifteen inequality restrictions and one equality restriction

    同時經過大量的工作，發現該優化問題的約束條件由15個不等式約束和1個等式約束組成。
  16. This paper applies generalized multipler method to translate convex quadratic programs with equal constraints and non - negative constraints into simple convex quadratic programs with non - negative constraints. the new algorithm is gotten by solving the simple quadratic program. it avoids the computation of inverse matrix and exploits sparsity structure in the matrix of the quadratic form. the results of numerical experiments show the effectiveness of the algorithm on large scale problems

    根據廣義乘子法的思想，將具有等式約束和非負約束的凸二次規劃問題轉化為只有非負約束的簡單凸二次規劃，通過解簡單凸二次規劃來得到解等式約束和非負約束的凸二次規劃新演算法，新演算法不用求逆矩陣，這樣可充分保持矩陣的稀疏性，用來解大規模稀疏問題.數值結果表明：在微機486 / 33上就能解較大規模的凸二次規劃
  17. Then we propose the problems that will be discussed in the following papers. also, we introduce the theory in the field of feasible region for semi - infinite programming, and concluded that in some area around the feasible points, feasible region can be expressed by finite inequality constraints, this results gives a base to the following algorithms

    接著介紹了半無限規劃可行域的結構和穩定點的穩定性，指出了關于可行域結構理論研究的現狀，並指出在一定的條件下，在可行點的局部鄰域內，可行域可以有有限個不等式約束來表示，這為第二、三章半無限規劃問題的演算法提供了理論基礎。
  18. However, some of them are restrictive. for some of these methods, the convergence is not known in this paper, based on a modified bfgs update formula proposed by li and fukushima, we propose a modified bfgs method for solving equality constrained optimization

    本文在li - fukushima提出的求解無約束問題的修正bfgs公式的基礎上，對求解等式約束問題的sqp演算法，提出一個保證qp子問題的目標函數的hessian陣的正定性的修正方案。
  19. In the meanwhile, seeing that the parameters are restricted for many practical problems, the author also studies the problems of optimal conditional prediction in the model with respect to two classes of restriction of linear parameter equations. what is more, the optimal conditional linear and optimal conditional ^ - linear unbiased predictors are also obtained respectively, which extends the results given by the predecessors and enrich the theory of optimal prediction

    考慮到對于實際問題，模型參數一般是要受到一定的約束，因此作者也研究了兩類線性等式約束條件下的模型的最優預測問題，得到了模型的最優條件線性無偏預測和最優條件-線性無偏預測，從而成功地推廣了前人的結果，豐富了這方面的預測理論
  20. We present and analyze a modified penalty functions ( mpf ) method for solving constrained optimization problems with inequality constraints. this method combines the modified penalty and the lagrangian methods

    本文提出並分析一種解決不等式約束最優化問題的修改的罰函數法，這一方法綜合利用修改的罰函數和拉格朗日法。
分享友人
分享到 Line

分享到臉書