線性約束 的英文怎麼說

中文拼音 [xiànxìngyāoshù]
線性約束 英文
linear constraint
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 線性 : [數學] [物理學] linear; linearity線性代數 linear algebra; 線性方程 linear equation; 線性規劃 line...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. Normally, we try to get the dual form of mathematical programming to change primary programming, which is difficult to be solved into its dual programming, which is easily to be solved. after we had got the dual form of two programming, we found their form were very simply because they had only nonnegative and linear constraints

    通常，我們求出規劃問題的對偶形式是希望將不易求解的原問題轉化為易於求解的對偶問題，在分別得到這兩類問題的對偶形式后，發現其形式簡單，只帶有非負約束和線性約束。
  2. According to the dual theory, a simple geometric programming was proposed to derive a corresponding geometric dual problem instead of cross - entropy optimization problem with cross - entropy constrains, which is a concave programming one with linear constrains, leading to a simpler calculation

    根據對偶理論，提出了一個簡單的幾何規劃，該方法把一個帶有叉熵約束的叉熵優化問題轉化成了一個對偶規劃，而對偶規劃是一個只需要解決一個帶有線性約束的凸規劃問題，比較容易計算。
  3. Heuristic algorithm for shortest path problem with nonlinear constraints

    非線性約束最短路問題的啟發式演算法
  4. The method uses both linearly constraints and quadratic pattern constraints to control the beam pattern, which is used in arbitrary array synthesis. it is simple effective and feasible

    此演算法同時應用了線性約束和二次約束來控制波束特徵，適用於任意陣列的綜合，演算法簡單，計算效率高。
  5. The multi - object simulated annealing algorithm for the nonlinear constraint optimization problem

    非線性約束最優化問題的多目標模擬退火演算法
  6. Three - term memory gradient rosen and solodov projection method for nonlinear programming with linear or nonlinear inequality constraints

    解帶線性或非線性約束最優化問題的混合三項記憶梯度投影演算法
  7. 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods

    3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法，該演算法完全避免因約束而引進的矩陣求逆運算（相對于常規的遞歸最小二乘演算法） ，不但運算量比常規的要低，而且比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時接收機演算法還低，且收斂速度比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時多用戶檢測都好，將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量，具有很大的實用價值，最後通過模擬實驗進一步分析了其性能。
  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. Because the different stiffness match of front and rear suspension is very influencing to the ride comfort, optimal model of ride comfort is developed, regarding the rms of driver ’ s acceleration as the objection, regarding the stiffness of front and back suspension as optimal variable, regarding quiet flexibility 、 dynamic flexibility 、 frequency and dynamic load as nonlinear constraints. by matlab program and using sqp, the optimal match of front and back suspension ’ s stiffness is achieved, this optimal model consider not only request of quiet 、 dynamic flexibility 、 frequency and damp, but also security of run and peace of road, it is closer to the fact than other models which only consider partial restriction

    由於前後懸架垂直剛度的不同匹配對汽車行駛平順性影響較大，論文建立以駕駛員垂直加速度的均方根值作為汽車行駛平順性優化目標值、以前後懸架垂直剛度作為優化變量的優化設計模型，並輔以靜撓度、動撓度、頻率、動載荷等非線性約束，使用序列二次規劃法，利用matlab編制優化程序，求得前後懸架垂直剛度的最優匹配值;此優化模型不僅包含動靜撓度及頻率和阻尼的限制，還考慮到汽車的行駛安全性和道路友好性，比文獻報道的只考慮部分約束的優化模型更切合實際情況。
  10. Abstract : the generalized shrunken prediction of finite population is introduced, using generalized shrunken least squares estimator of linear regression models. with respect to prediction mean squared error, a necessary and sufficient condition for superiority of a generalized shrunken prediction over the best linear unbiased prediction is obtained. in the case of linear combination of every unit index, a linear restricting prediction is introduced and then a necessary and sufficient condition for superiority of linear restricting prediction over the best linear unbiased prediction is devived

    文摘:利用線性回歸模型的廣義壓縮最小二乘估計，引入了有限總體的廣義壓縮型預測，在預測均方誤差意義下，得到了廣義壓縮型預測優于最佳線性無偏預測的一個充分必要條件；在只能得到每個個體指標的線性組合時，引入了一種線性約束型預測，並得到了線性約束型預測優于最佳線性無偏預測的一個充分必要條件
  11. In this paper, an optimal model for arrangement is designed, which is with multi - objective function and nonlinear constraints, and an improved genetic algorithm with penalty strategy is proposed to solve the optimization problem

    本文建立生料漿調配過程的優化模型，針對模型中的多目標函數以及非線性約束特點，提出一種結合懲罰策略的改進遺傳演算法進行尋優。
  12. On nonlinear constrained optimization

    非線性約束優化問題
  13. A trust - region algorithm for nonlinear constrained optimization problem

    解非線性約束優化問題的依賴域演算法
  14. 11 gormaz r, laurent p j. some results on blossoming and multivariate b - splines. multivariate approximation : from cagd to wavelets, world sci

    由於只需要求解一個帶線性約束的最小二乘問題，因此該方法具有速度快，數值穩定性好的特點。
  15. Combining the above signal model and the conventional lcmv method at element level we present a lcmv method at subarray level. in all kinds of jammer scenarios, the method can suppress jammers well, but the disadvantage is that the sll ( sidelobe level ) of adaptive patterns is much higher

    將上述提出的信號模型與常規線性約束最小方差（ lcmv ）方法相結合得到子陣級lcmv方法，在各種干擾情況下該方法都可以實現對干擾的很好抑制，但其局限性是自適應方向圖的旁瓣電平較高。
  16. There are many existing algorithms that solve the maximin or minimax programming without constraint or with linear constraints. some of the algorithms need the 2nd order differential information of objective functions

    人們已提出了一些求解maximin （或minimax ）規劃的演算法，這些演算法要求規劃問題無約束或具有線性約束，以及要求有關函數的二次微分信息
  17. In chapter 2. we give a class of new algorithms for nonlinear programming problems with linear constrained by combining the gradient projection method with non - quasi - newton method which was given in paper [ 2 ]. it ' s global convergence and the superlinear convergence are proved under suitable conditions

    在第二章中我們將梯度投影與文[ 2 ]中的非擬牛頓法相結合，給出了求解線性約束非線性優化問題的一類梯度投影非擬牛頓演算法。
  18. In chapter 3, we give a class of new algorithms with inexact search for nonlinear programming problems with linear constrained by combining the generalized projection method with non - quasi - newton method. it ' s global convergence and the superlinear convergence are proved under suitable conditions

    新演算法推廣了文[ 1 ， 2 ]中的結果。在第三章中我們將廣義投影演算法與非擬牛頓法相結合，給出了求解線性約束非線性優化問題的一類廣義投影非擬牛頓演算法。
  19. In the third chapter we discuss lc1 constrained optimization problem. to solve it, we turn it into nonsmooth equations, utilizing inexact theory we give an inexact generalized newton ' s method and under some mild conditions we prove that it is global convergence and superlinear convergence

    首先將其約束問題的求解轉化為非光滑方程組的求解，然後利用不完全求解理論給出了一個非精確的廣義牛頓演算法，在一定的條件下證明了演算法的全局收斂性和局部超線性收斂性並給出了lc ~ 1非線性約束問題的收斂性條件。
  20. This paper presents an interior trust region method for linear constrained lc ^ 1 convex optimization problems

    摘要本文提出一種解線性約束凸規劃的數值方法。
分享友人
分享到 Line

分享到臉書