quadratic programming problem 中文意思是什麼

quadratic programming problem 解釋
二次規劃問題
  • quadratic : adj. 1. 【數學】二次的。2. 方形的。n. 1. 【數學】二次方程式；二次項。2. 〈pl. 作單數用〉【數學】二次方程式論。
  • programming : 編程序的
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. 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

    概述了統計學習理論的主要內容，推導了支持向量機方法在文本線性可分、線性不可分和非線性可分情況下實現分類的數學公式，將學習問題轉化為一個在等式約束和不等式約束下的凸二次優化問題，總結了求解的過程。
  2. In the second part, a decomposition method for solving semidefmite quadratic programming with box constraints is proposed. a regular splitting of the hessian matrix of the problem is used in the algorithm. the convergence of the algorithm is proved under certain assumptions, the numerical results are also given

    第二部分把解邊界約束正定二次規劃問題的正則分解演算法推廣到求解邊界約束半正定二次規劃問題，在理論證明的基礎上還進行數值檢驗，結果說明演算法是有效的。
  3. On a class of quadratic programming problem with equality constraints

    一類帶有等式約束的二次規劃問題
  4. The quadratic programming perturbation approximation method for the linear programming problem

    求解線性規劃問題的二次規劃攝動逼近法
  5. A program of shape optimization for two - dimensional continuum structures, which is carried out on msc. patran & nastran panel, is described in this thesis, according to a two - phase control theory presented by professor sui yunkang, the optimization is treated as a sequential quadratic programming problem

    本文根據隋允康教授提出的二級控制理論，將二維連續體結構的形狀優化問題處理成序列二次規劃問題進行了優化。
  6. 2. for the problem with size, stress and displacement constraints, the stress constraint is transformed into movable lower bounds of sizes, the displacement constraint is transformed into an approximate function which explicitly includes design variables by using mohr integral theory. a mathematical programming model of the optimization problem is set up. the dual programming of the model is approached into a quadratic programming model

    2 .對于尺寸、應力和位移約束的問題，將應力約束化為動態下限，用單位虛荷載方法將位移約束近似顯式化，構造優化問題的數學規劃模型，將其對偶規劃處理為二次規劃問題，採用lemke演算法進行求解，得到滿足尺寸、應力和位移約束條件的截面最優解。
  7. Based on the { - 1, 1 } quadratic programming model for the design of fir digital filters with discrete coefficients, and by use of the global optimal conditions of the { - 1, 1 } quadratic programming, a judgment criterion for the elements of the optimal solution is proposed, and a smaller scale design problem of fir digital filters with discrete coefficients is obtained

    該方法基於離散系數濾波器設計問題的{ - 1 ， 1 }二次規劃模型，利用{ - 1 ， 1 }二次規劃的全局最優性條件，提出了一種最優解元素的判斷準則，得到了一個規模較小的離散系數濾波器設計問題。
  8. A controllable scheduling problem with discrete processing times using convex quadratic programming relaxation

    凸二次規劃鬆弛方法研究離散加工時間可控排序問題
  9. Fixed iterative method for solving the inequality constrained quadratic programming problem

    不等式約束二次規劃的不動點迭代
  10. Maximum entropy method and quadratic programming sub - problem ' s explicit solution

    極大熵方法與二次規劃子問題的顯式解
  11. An interior point algorithm for convex quadratic programming problem with box constraints

    框式約束凸二次規劃問題的內點演算法
  12. A global convergence inner - point style algorithm for generic quadratic programming problem

    二次規劃問題的一個全局收斂的內點型演算法
  13. Training svm can be formulated into a quadratic programming problem. for large learning tasks with many training examples, off - the - shelf optimization techniques quickly become intractable in their memory and time requirements. thus, many efficient techniques have been developed

    訓練svm的本質是解決一個二次規劃問題，在實際應用中，如果用於訓練的樣本數很大，標準的二次型優化技術就很難應用。
  14. In order to improve the efficiency of the algorithm, we not only correct some defects of the primal - dual interior point algorithm in [ 4 ], but also give a modified primal - dual interior point algorithm for convex quadratic programming problem with box constraints

    為提高演算法的有效性，對文[ 4 ]所給的原始-對偶內點演算法理論上的某些缺陷加以更正，並給出框式約束凸二次規劃問題的一個修正原始-對偶內點演算法。
  15. For nonlinear l1 problem based on the conditions for optimality of the nonlinear l1 problem in [ 1 ], we first discuss the descent direction of the objective function f ( x ) in theory, further more, we study the relation between the optimal solution of nonlinear l1 problem and the optimal solution of some kind of quadratic programming problem with box constrains. hence, we construct a descent algorithm for nonlinear l1 problem and prove the convergence of the algorithm

    在文[ 1 ]所給的最優性條件的基礎上，對非線性l _ 1問題從理論上研究了f （ x ）的下降方向、最優解與某種框式約束最小二乘問題的最優解之間的關系，進而構造了一個非線性l _ 1問題的下降演算法，並證明了該演算法的收斂性。
  16. When solving the problems, we use the support vector regression ( svr ). first assuming the formula of function, then according to the differential and boundary conditions we transform the original problem to the quadratic programming problem. finally, use the learning algorithm of svr to decide the parameters

    只要事先假設出所求函數的表達式，然後根據已知的微分關系和邊界條件對待求函數進行約束將原問題轉化為二次規劃問題，再採用支持向量機回歸演算法對樣本進行學習即可求出參數，確定待定函數的關系式。
  17. The separating plane with maximal margin is the optimal separating hyperplane which has good generation ability. to find a optimal separating hyperplane leads to a quadratic programming problem which is a special optimization problem. after optimization all vectors are evaluated a weight. the vector whose weight is not zero is called support vector

    而尋找最優分類超平面需要解決二次規劃這樣一個特殊的優化問題，通過優化，每個向量（樣本）被賦予一個權值，權值不為0的向量稱為支持向量，分類超平面是由支持向量構造的。
  18. The basic idea of an sqp method is to approximate the constrained problem by a sequence of quadratic programming ( qp ) problems

    Sqp演算法的基本思想是通過求解一系列二次規劃（ qp ）子問題來求解原最優化問題
  19. We investigate the decision - making problem with a finite set of alternatives, in which the decision information takes the form of a fuzzy preference relation. we develop a simple and practical approach to obtaining the priority vector of a fuzzy preference relation. the prominent characteristic of the developed approach is that the priority vector can generally be obtained by a simple formula, which is derived from a quadratic programming model. we utilize the consistency ratio to check the consistency of fuzzy preference relation. if the fuzzy preference relation is of unacceptable consistency, then we can return it to the decision maker to reconsider structuring a new fuzzy preference relation until the fuzzy preference relation with acceptable consistency is obtained. we finally illustrate the priority approach by two numerical examples. the numerical results show that the developed approach is straightforward, effective, and can easily be performed on a computer

    研究了決策信息以模糊偏好關系給出的有限方案決策問題，提出了一種簡潔且實用的模糊偏好關系排序方法.該方法首先建立一個二次規劃模型，然後基於該模型推導出求解模糊偏好關系排序向量的一個簡潔公式.基於獲得的排序向量，利用一致性比例對模糊偏好關系進行一致性檢驗.對於一致性較差的模糊偏好關系，則需反饋給決策者重新進行判斷，直至得到一個一致性可接受的模糊偏好關系為止.最後，利用2個算例對該方法進行分析和說明，數值結果表明該方法簡潔、有效，且易於在計算機上操作
  20. Dual mathematical programming is used to map the original problem exactly and the second approximation of the dual problem is set up by taylor ' s expand form, it is solved by qp ( quadratic programming ) solving device

    用對偶數學規劃精確映射原問題，用泰勒展式建立對偶問題的二階近似。最後用二次規劃求解器求解。
分享友人
分享到 Line

分享到臉書