inequality constraints 中文意思是什麼

inequality constraints 解釋
不等式約束
  • inequality : n. 1. 不平等，不平均，不平衡，不等量。2. 不相同，互異。3. 變動，變化，高低，起伏。4. 【數學】不等式；【天文學】均差。5. （平面等的）不平坦。6. 不勝任。
  • constraints : 變動極限
  1. 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模型，對期望定位用戶的各條多徑信號的波達方向和最先到達多徑信號的時間進行約束，將傳統的解無約束的非線性最小二乘定位問題或近似線性最小二乘定位問題轉化為解不等式約束的非線性最小二乘定位問題；然後，用內點罰函數法估計移動臺的位置。
  2. It is based on mpf, which treats inequality constraints with a modified penalty term. the mpf method alternatively minimizes the mpf and updates the lagrange multipliers. the mpf method avoids the in - differentiability of the max { x, 0 }

    修改的罰函數法所用的罰函數消除了經典罰函數的主要缺點，修改的罰函數存在解，且在解的鄰域內保持目標函數和約束函數的光滑性。
  3. 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

    接著介紹了半無限規劃可行域的結構和穩定點的穩定性，指出了關于可行域結構理論研究的現狀，並指出在一定的條件下，在可行點的局部鄰域內，可行域可以有有限個不等式約束來表示，這為第二、三章半無限規劃問題的演算法提供了理論基礎。
  4. 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

    本文提出並分析一種解決不等式約束最優化問題的修改的罰函數法，這一方法綜合利用修改的罰函數和拉格朗日法。
  5. Three - term memory gradient rosen and solodov projection method for nonlinear programming with linear or nonlinear inequality constraints

    解帶線性或非線性約束最優化問題的混合三項記憶梯度投影演算法
  6. 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

    摘要對不等式約束最小二乘平差問題，藉助非線性規劃中的凝聚約束方法把多個不等式約束轉化為一個等式約束，採用拉格朗日極值法求解，解與貝葉斯解或單純形解一致。
  7. Mathematical programs with equilibrium constraints is a kind of specail opti - mzation problem, which besides equality constraints and inequality constraints it also contain complementarity constraints

    帶有均衡約束的數學規劃問題（ mathematicalprogramswithequilibriumconstrains ，縮寫為mpec ）是一類特殊的最優化問題，它的約束函數除了一般的等式和不等式約束之外，還包含有互補約束條件
  8. By introducing the concepts of constraints measure and feasible degree, the extent to which the decision variables subject to the inequality constraints and equality constraints is described and then the self - adaptive penalty function is constructed, whose values are adaptively changed with the constraints feasible degree

    該策略通過引入約束可行測度、可行度等概念來描述決策變量服從于不等式約束和等式約束的程度，並以此構造處理約束條件的自適應懲罰函數，懲罰值隨著約束可行度的變化而動態自適應地改變。
  9. For applying the hybrid optimization algorithm to solve the optimization problem with constraints, a self - adaptive penalty strategy for handling the constraints is designed, which is used to convert the optimization problem with inequality constraints and equality constraints to the one only with the upper and lower bound constraints of the decision variables

    為了便於應用混合優化演算法對約束優化問題進行求解，設計了一種處理約束條件的自適應懲罰策略，用於將具有不等式約束和等式約束的優化問題轉變為僅包含決策變量上、下限約束的優化問題。
  10. Global optimal conditions with inequality constraints

    帶有不等式約束的全局最優性條件
  11. Generalized three term - memory gradient projection method for nonlinear programming with nonlinear equality and inequality constraints

    求解非線性等式和不等式約束優化問題的三項記憶梯度廣義投影演算法
  12. Aiming at more general nonlinear optimizations subject to linear inequality constraints, this article proposes curvilinear path trust region algorithms

    本文針對更為一般的帶線性不等式約束的優化問題提出弧線路徑信賴域演算法。
  13. In the end the paper reveals the correspondence between generalized splines with obstacles and optimal control problems with state - variable inequality constraints

    最後，揭示了狀態帶不等式約束的最優控制解的必要性準則與帶障礙的廣義插值樣條的聯系。
  14. In nature, opf belongs to a kind of large scale nonlinear programming problem with equality and inequality constraints, having a non - convex, high - dimension and highly sparse characteristic

    Opf本質上屬於一個具有等式和不等式約束的大規模非線性規劃問題，具有非凸、高維數、高度稀疏的特性。
  15. By means of the reduced correction equation, the propose algorithm can efficiently handle a huge number of functional inequality constraints for large scale optimization problems in power system ; 3

    藉助于簡約修正方程，能夠有效地處理大量的不等約束問題，因此，特別適合於大規模的電力系統問題； 3
  16. Mayor : operation and control theory author : cheng - jia gao advisor : prof. nan - jing huang abstract : this paper includes two chapters. in the first part, we concerns optimization problems with quasi - variational inequality constraints

    =本文包括兩部分第一部分，我們研究具擬變分不等式約束的優化問題運用有限維空間s
  17. This paper presents a new method for designing robust h control system, in which the design objectives are converted into the inequality constraints and the selection of weighting functions in h controller design is expressed as a multi - objective optimization problem. the h controller, which satisfies given frequency - domain and time - domain performance indexes, can be found by using genetic algorithm ( ga ) to optimize the weighting functions

    本文提出了一種基於遺傳演算法的h控制系統設計方法，把控制系統的多個設計目標轉化成不等式約束，將h控制器設計中加權陣的選取表示成一個多目標優化問題，通過遺傳演算法優化加權陣參數，進而找到同時滿足給定的頻域和時域性能指標要求的h控制器。
  18. Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints. we prove, under some mild assumptions, the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions. the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms

    第2章建立求解不等式約束優化問題的一類對偶演算法的理論框架，在適當的假設條件下，證明了該類演算法的局部收斂性質，並給出近似解的誤差界，驗證了polyak （ 1992 ）的修正障礙函數演算法以及bertsekas （ 1982 ）的增廣lagrange函數演算法都是這類演算法的特例。
  19. According to the internal character of price control problem, the authors use the related results of exact penalty function and equilibrium complementarities to transform the price control problem with hi - level special property into equivalent single level mathematical program that consists of equality and inequality constraints, consequently, to offer some basis for optimality condition arid algorithm of this problem

    摘要針對價格控制問題具有的內在特點，利用均衡互補及精確罰函數的相關理論，把具有二層特性的價格控制問題轉化為與其等價的具有等式和不等式約束的單層數學規劃，從而為研究此類問題的最優性條件和求解演算法提供一定的依據。
  20. The model of dwell function synthesis of planar six - bar mechanism in the dissertation is decomposed into two relatively independent sub - questions. the first one is to evaluate the characteristic of points on moving rigid body, whose mathematics model is a kind of special non - differential max - mini optimal problem with inequality constraints

    對于誤差評定，本文利用加權理論，對要求綜合的平面六桿機構提出了在保證間歇部分精度要求的條件下，使非間歇部分誤差盡可能小的評價思想。
分享友人
分享到 Line

分享到臉書