quadratic programming 中文意思是什麼

quadratic programming 解釋
二次規劃法
  • quadratic : adj. 1. 【數學】二次的。2. 方形的。n. 1. 【數學】二次方程式；二次項。2. 〈pl. 作單數用〉【數學】二次方程式論。
  • programming : 編程序的
  1. The prospect geological disaster geographic information system is based on the visual basic, and make use of mapobject of esri corporation to do then quadratic programming of cis, connected with the mapobject prepotency of geological information system

    地質災害勘察綜合地球物理信息管理與解釋系統是在visualbasic的基礎上，利用esri公司的mapobject軟體進行gis的二次開發，把visualbasic的強大的平臺和mapobject地理信息系統方面的優勢緊密的結合在一起。
  2. Interior point approach for convex quadratic programming

    凸二次規劃問題的內點演算法
  3. 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

    概述了統計學習理論的主要內容，推導了支持向量機方法在文本線性可分、線性不可分和非線性可分情況下實現分類的數學公式，將學習問題轉化為一個在等式約束和不等式約束下的凸二次優化問題，總結了求解的過程。
  4. 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

    第二部分把解邊界約束正定二次規劃問題的正則分解演算法推廣到求解邊界約束半正定二次規劃問題，在理論證明的基礎上還進行數值檢驗，結果說明演算法是有效的。
  5. For the purpose of discovering the near - globally optimal solution, this paper proposed a hybrid approach of ant colony algorithm and sequential quadratic programming ( sqp )

    摘要為了獲得整體近似最優解，提出採用蟻群演算法，搜索發電機可運行狀態的最優組合，並對蟻群演算法的數學模型進行分析，以參數的形式給出具有普遍意義的收斂性定理。
  6. On a class of quadratic programming problem with equality constraints

    一類帶有等式約束的二次規劃問題
  7. As an application of succeeding, a numerical example of max - cut is given. 3. several semidefinite relaxation detection strategies of the cdma maximum likelihood multiuser detection are investigated. rounding, coordinate descent, cutting plane and branch and bound based on quadratic programming algorithm are presented to get the suboptirnal solution

    本文紿出了基於半定規劃模型尋求多用戶檢測問題次優解的幾種重要方法，包括隨機擾動法、坐標下降法、半定規劃的割平面法和二次規劃的分枝定界法等
  8. And based on these, the application of sequential quadratic programming ( sqp ) to the turbofan engine performance seeking control is investigated

    並在此基礎上，運用序列二次規劃法對渦扇發動機的加、減速和加力加速等過渡過程尋優控制問題進行了研究。
  9. In this paper, we are concerned with the sequence quadratic programming ( sqp ) methods for solving constrained optimization problems

    本文研究求解約束最優化問題的序列二次規劃演算法（ sqp演算法） 。
  10. The quadratic programming perturbation approximation method for the linear programming problem

    求解線性規劃問題的二次規劃攝動逼近法
  11. 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

    本文根據隋允康教授提出的二級控制理論，將二維連續體結構的形狀優化問題處理成序列二次規劃問題進行了優化。
  12. 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演算法進行求解，得到滿足尺寸、應力和位移約束條件的截面最優解。
  13. The paper discussed a method combining integer programming based on similarity coefficient with quadratic programming considering ratio of capacity to loading in workshop to obtain parts families and machines groups in two steps

    摘要採用了基於相似系數的整數規劃和考慮車間資源負荷分配比率的二次規劃相結合的方法，分兩步得到了零件族和設備組。
  14. This paper consists of two parts. in the first part, a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed

    本文分兩部分，第一部分研究求解邊界約束非凸二次規劃問題的整體最優解的分支定界演算法。
  15. Such methods are generally decreasing method, such as, feasible direction methods, constrained variable metric methods, etc. another class is sub - problems method, which approximates the optimal solution by solving a series of simple sub - problems, such as penalty function methods, trust region methods, and successive quadratic programming sub - problems, etc. the same property of two classes of methods is that they determine whether the next iterative point is " good " or " bad " by comparing the objective function value or merit function value at the current point and next iterative point

    另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。
  16. Thirdly, the principles of nurbs curve and surface are used to the modeling of complex object, and a protruding quadratic programming algorithm for reconstructing reference points of nurbs curve

    第三，採用了nurbs曲線、曲面技術對復雜目標建模，給出了反求nurbs曲線控制點的凸二次規劃演算法。
  17. Sequential quadratic programming ( sqp ) method is developed to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subject to the physical constraints on joint velocities, accelerations, and jerk. algorithm comparison of flexible polyhedron and sqp is done to show the good quality of sqp

    在速度、加速度、加速度變化率的約束條件下，使用二次規劃法獲得了運動總時間最短時的關節軌跡，將所用演算法與現有演算法對比表明了所用演算法的優化性。
  18. The work including : ( 1 ) optimization theory and the essence of svm training method the essence of svm training method is to solve quadratic programming ( qp ), and it belongs to the area of optimazation theory

    本文工作包括： （ 1 ）最優化理論的學習以及訓練演算法的本質svm訓練的本質是解決一個二次規劃（ quadraticprogramming ，簡稱qp ）問題，這是最優化理論的范疇。
  19. But j. v. outrata, m. kocvara, et. al. pointed out in 1998 that the equivalent ssnp did n ' t satisfy the weaker mangasarian - fromotitz constraint qualification in any feasible points. so it will be very difficult to get the solution of lcp by means of existing methods for ssnp such as sequential quadratic programming ( sqp for short ) type algorithms, sequential systems of linear equations ( ssle for short ) type algorithms

    Kocvara等人在1998年指出了等價的ssnp在任何可行點處都不滿足比較弱的mangasarian - fromotitz約束規格，因此，通過用已有的求解ssnp的一些方法如序列二次規劃（簡記為sqp ）類演算法、序列線性方程組（簡記為ssle ）類演算法解等價的ssnp來獲得線性互補約束問題的解，會有相當的困難
  20. 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 }二次規劃的全局最優性條件，提出了一種最優解元素的判斷準則，得到了一個規模較小的離散系數濾波器設計問題。
分享友人
分享到 Line

分享到臉書