約束最小化 的英文怎麼說

中文拼音 [yāoshùzuìxiǎohuà]
約束最小化 英文
constrained minimization
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. In this paper matlab and vb are used to build a software which can predict absorption coefficient ' s of the underwater anechoic coatings from these analytical models. finally, some algorithm of the single parameter minimization, nonrestraint nonlinear minimization and restraint minimization in the optimization design theory are studied. the formulas of absorption coefficient of these analytical models are object functions

    本論文利用各種解析模型的聲學設計理論，使用matlab與vb軟體建立了一套水下消聲覆蓋層吸聲系數預報軟體，研究了最優化設計中單參數最小化、無約束非線性最小化和有約束最小化理論的一些演算法，利用現有模型的吸聲系數計算公式作為目標函數，初步優化了一些結構的材料參數。
  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. The minimum erathwork of slope cutting is regarded as target function, and the anticipated factor of safety of slope as a constraint condition, so this problem is equivalent to optimality one with constraint conditions. thus the optimal scheme of slope cutting can be obtained

    這里將最小的削坡土方量作為目標函數，將預期的邊坡安全系數作為約束條件，把削坡問題等價於一個有約束的優化問題，可找出最優的削坡方案。
  4. The structured bfgs method is a quasi - newton method for solving the nonlinear least squares problem

    解非線性最小二乘問題的結構化擬newton方法是求解無約束最優化問題的標準擬newton方法的推廣。
  5. Constrained minimization problem

    約束最小化問題
  6. Based on the analyses of the investment of nozzle tube net and relationship between the annual operation cost and tube diameter function of a fixed spray irrigation system, a mathematic model to calculate the economical tube diameter of a spray irrigation system is developed by using the minimum expense norm and nonlinear planning theory in engineering economic analysis, and a direct calculation formula for the economical tube diameter in unrestrained conditions is presented

    摘要在分析了固定式噴灌系統的管網投資、年運行費用與管徑函數關系的基礎上，利用工程經濟分析中費用最小化準則和非線性規劃理論，建立了求解噴灌系統管網經濟管徑的數學模型，並給出了無約束條件直接求解經濟管徑的計算式。
  7. On one hand, from the technique of constrained least squares and limited energy of additive noise, an effective restored approach by adopting regularization method to overcoming ill - posed problem, solving an equation with a single variable, and using space iterative algorithm is proposed ; on the other hand, aiming at the restoration of blurred image, another effective restoration approach based on least - square algorithm is also proposed in this paper. this method firstly adopts increment iterative algorithm to improve convergence and meanwhile applies regularization technique to overcome ill - posed problem. in the computations, the regularized parameter has its adaptive character, which can be determined in terms of the restored image at each iteration step therefore automatically correct to the appropriate value

    一是從約束最小二乘出發，在加性噪聲能量有界的前提下，採用正則化方法來克服病態問題，通過解一個單變量方程，並利用空域迭代運算實現了一種有效的圖像復原;二是針對模糊圖像的復原問題，從最小二乘演算法出發，採用增量迭代的方法改善演算法的收斂性，同時結合正則化技術克服問題的病態性質，並引入自適應的正則化參數，使其與圖像復原的迭代運算同步進行並自動修正到最優值。
  8. This method is easy to implement and has no restriction on array geometry and sensor patterns ; three methods for the design of broadband frequency invariant beamformer are proposed, which are the method of resampling signals received by the array, the dft ( discrete fourier transform ) interpolation method and adaptive synthesis method, respectively. examples and performance analyses are given for each method ; a simplified linear constrained minimum variance broadband adaptive algorithm that based on dft interpolation method is presented. compared with conventional broadband adaptive algorithms, the presented method can reduce computation work greatly

    提出了一種簡單、易於實現的恆定束寬波束形成器設計方法，該方法對陣形和陣元指向性沒有任何限制；分別提出了基於陣列接收數據重采樣、基於dft插值和自適應綜合的三種具有頻率不變波束圖的寬帶波束形成器設計方法，對于每一種設計方法都給出了一個設計實例並做了性能分析；提出一種基於dft插值的簡化線性約束最小方差寬帶自適應陣列演算法，該方法可以大大降低自適應陣列的運算量。
  9. Thus, it can ensure no cancellation of the desired signal when minimizing the cm cost function to suppress interference. in this paper, delay - hypothesized matched filter based on minimum kurtosis criterion is used to initialize code - constrained cma

    通過對均衡器的權向量增加約束，使其在迭代更新最小化代價函數時，能在有效抑制干擾的同時保證期望用戶信號不被抑制。
  10. Based on the minimum cross entropy theory, a new model, which can forecast mortality distribution by minimizing the cross entropy function subject to the future life expectancy of insurants, is proposed

    基於最小叉熵原理，建立了預測被保人死亡率分佈的一個模型最小叉熵模型，該模型以叉熵函數作為目標函數，以被保人的預期壽命作為約束條件，通過最小化叉熵預測被保人的死亡率。
  11. 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是二次連續可微的，可以有許多方法尋找它的極小點。
  12. 8 chakrabarty k. test scheduling for core - based systems using mixed - integer linear programming. ieee trans. computer - aided design of integrated circuits and systems, oct. 2000, 19 : 1163 - 1174

    在我們的方案中，我們考慮了存儲器大小的約束多核系統的最小化測試時間以及較高的故障覆蓋率。
  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. The thesis uses 0 - 1 integer linear programming to construct algorithm - hardware mapping models. based on bounds of data flow graph proposed by barwell and hodges, cost function combining iteration periodic bound with periodic delay bound and several constraints are proposed

    根據已提出的數據流圖的界，確定規劃和映射模型的目標函數，即最小化循環周期界和周期延遲界，進而建立規劃和映射問題的一系列的約束條件。
  15. Abstract : a new method, collaborative allocation ( ca ), is proposed to solve the large - scale optimum allocation problem in aircraft conceptual design. according to the characteristics of optimum allocation in aircraft conceptual design. the principle and mathematical model of ca are established. the optimum allocation problem is decomposed into one main optimization problem and several sub - optimization problems. a group of design requirements for subsystems are provided by the main system respectively, and the subsystems execute their own optimizations or further provide the detailed design requirements to the bottom components of aircraft, such as spars, ribs and skins, etc. the subsystems minimize the discrepancy between their own local variables and the corresponding allocated values, and then return the optimization results to main optimization. the main optimization is performed to reallocate the design requirements for improving the integration performance and progressing toward the compatibilities among subsystems. ca provides the general optimum allocation architecture and is easy to be carried out. furthermore, the concurrent computation can also be realized. two examples of optimum reliability allocation are used to describe the implementation procedure of ca for two - level allocation and three - level allocation respectively, and to validate preliminarily its correctness and effectiveness. it is shown that the developed method can be successfully used in optimum allocation of design requirements. then taking weight requirement allocation as example, the mathematical model and solution procedure for collaborative allocation of design requirements in aircraft conceptual design are briefly depicted

    文摘:探討了一種新的設計指標最優分配方法- -協同分配法，用於處理飛機頂層設計中的大規模設計指標最優分配問題.分析了飛機頂層設計中的設計指標最優分配特徵，據此給出了協同法的原理並建立了數學模型.協同法按設計指標分配關系將最優分配問題分解為主系統優化和子系統優化，主優化對子系統設計指標進行最優分配，子優化以最小化分配設計指標值與期望設計指標值之間的差異為目標，進行子系統最優設計，或對底層元件（如飛機翼梁、翼肋和翼盒等）進行設計指標最優分配，並把最優解信息反饋給主優化.主優化通過子優化最優解信息構成的一致性約束協調分配量，提高系統整體性能，並重新給出分配方案.主系統與子系統反復協調，直到得到設計指標最優分配方案.兩層可靠度指標分配算例初步驗證了本文方法的正確性與可行性，三層可靠度指標分配算例證明了本文方法的有效性.最後，以重量指標分配為例，簡要敘述了針對飛機頂層設計中設計指標協同分配的數學模型和求解思路
  16. A new method, collaborative allocation ( ca ), is proposed to solve the large - scale optimum allocation problem in aircraft conceptual design. according to the characteristics of optimum allocation in aircraft conceptual design. the principle and mathematical model of ca are established. the optimum allocation problem is decomposed into one main optimization problem and several sub - optimization problems. a group of design requirements for subsystems are provided by the main system respectively, and the subsystems execute their own optimizations or further provide the detailed design requirements to the bottom components of aircraft, such as spars, ribs and skins, etc. the subsystems minimize the discrepancy between their own local variables and the corresponding allocated values, and then return the optimization results to main optimization. the main optimization is performed to reallocate the design requirements for improving the integration performance and progressing toward the compatibilities among subsystems. ca provides the general optimum allocation architecture and is easy to be carried out. furthermore, the concurrent computation can also be realized. two examples of optimum reliability allocation are used to describe the implementation procedure of ca for two - level allocation and three - level allocation respectively, and to validate preliminarily its correctness and effectiveness. it is shown that the developed method can be successfully used in optimum allocation of design requirements. then taking weight requirement allocation as example, the mathematical model and solution procedure for collaborative allocation of design requirements in aircraft conceptual design are briefly depicted

    探討了一種新的設計指標最優分配方法- -協同分配法，用於處理飛機頂層設計中的大規模設計指標最優分配問題.分析了飛機頂層設計中的設計指標最優分配特徵，據此給出了協同法的原理並建立了數學模型.協同法按設計指標分配關系將最優分配問題分解為主系統優化和子系統優化，主優化對子系統設計指標進行最優分配，子優化以最小化分配設計指標值與期望設計指標值之間的差異為目標，進行子系統最優設計，或對底層元件（如飛機翼梁、翼肋和翼盒等）進行設計指標最優分配，並把最優解信息反饋給主優化.主優化通過子優化最優解信息構成的一致性約束協調分配量，提高系統整體性能，並重新給出分配方案.主系統與子系統反復協調，直到得到設計指標最優分配方案.兩層可靠度指標分配算例初步驗證了本文方法的正確性與可行性，三層可靠度指標分配算例證明了本文方法的有效性.最後，以重量指標分配為例，簡要敘述了針對飛機頂層設計中設計指標協同分配的數學模型和求解思路
  17. In model, the fare of agc regulation be accounted for in the objective function to achieve the least total purchase cost and the problem solution respects generator constraints, such as ramp rate limits and agc regulation capacity constraints

    本文正是基於上述兩點考慮，提出了一種計及agc調節容量的機組組合優化模型。模型中考慮了agc的上調、下調費用和機組的agc調節容量約束，從而達到系統購電總成本最小化。
  18. Abstract : an algorithm of minimizing the number of buffers under certain delay constraint with accurate delay models is presented. given a two - terminal net, the algorithm can minimize the total number of buffers inserted to meet the delay constraint. a high order delay model is applied to estimate interconnect delay and a nonlinear delay model based on look - up table is for buffer delay estimation. the experimental results show that the algorithm can efficiently achieve the trade - offs between number of buffers and delay, and avoid needless power and area cost. the running time is satisfactory

    文摘:提出了在精確時延模型下，滿足時延約束的緩沖器數目最小化的演算法.給出一個兩端線網，該演算法可以求出滿足時延約束的最小緩沖器數目.運用高階時延模型計算互連線的時延，運用基於查找表的非線性時延模型計算緩沖器的時延.實驗結果證明此演算法有效地優化了緩沖器插入數目和線網的時延，在二者之間取得了較好的折中.演算法的運行時間也是令人滿意的
  19. For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization, a heuristic search method is proposed, in which based on minimum spanning tree, degrees of vertices over the constrained degrees are reduced to the required state

    摘要針對網路設計和優化中度約束最小生成樹問題，提出了一種基於貪心思想的啟發式演算法求解度約束最小生成樹。
  20. In order to express imaging problem accurately, moreover, projection equations are introduced as the restricted condition of single objective optimization, and then a restricted least - square iteration algorithm for image reconstruction from projections is proposed to get the reconstructed results with little artifact quickly and concisely

    此外，為了更準確表達問題，引入投影方程作為標量優化的約束條件進行重建求解，提出了一種約束最小二乘估計的圖像重建演算法。其特點是迭代表達式簡單，速度快，而且能很好地消除重建偽影。
分享友人
分享到 Line

分享到臉書