非凸二次規劃 的英文怎麼說
中文拼音 [fēitūèrcìguīhuà]
非凸二次規劃
英文
nonconvex quadratic programming- 非 : Ⅰ名詞1 (錯誤) mistake; wrong; errors 2 (指非洲) short for africa 3 (姓氏) a surname Ⅱ動詞1 ...
- 凸 : Ⅰ動詞(高出) bulge; protrude Ⅱ形容詞(高於周圍) protruding; raised
- 二 : Ⅰ數詞(一加一后所得) two Ⅱ形容詞(兩樣) different
- 次 : Ⅰ名詞1 (次序; 等第) order; sequence 2 [書面語] (出外遠行時停留的處所) stopping place on a jou...
- 規 : Ⅰ名詞1 (畫圓形的工具) instrument for drawing circles 2 (規則; 成例) rule; regulation 3 [機械...
- 劃 : 劃動詞1 (撥水前進) paddle; row 2 (合算) be to one s profit; pay 3 (用尖銳的東西在別的東西上...
- 規劃 : 1 (比較全面的長遠的發展計劃) planning; programming; project; schematization; programme; plan 2 ...
-
This paper applies generalized multipler method to translate convex quadratic programs with equal constraints and non - negative constraints into simple convex quadratic programs with non - negative constraints. the new algorithm is gotten by solving the simple quadratic program. it avoids the computation of inverse matrix and exploits sparsity structure in the matrix of the quadratic form. the results of numerical experiments show the effectiveness of the algorithm on large scale problems
根據廣義乘子法的思想,將具有等式約束和非負約束的凸二次規劃問題轉化為只有非負約束的簡單凸二次規劃,通過解簡單凸二次規劃來得到解等式約束和非負約束的凸二次規劃新演算法,新演算法不用求逆矩陣,這樣可充分保持矩陣的稀疏性,用來解大規模稀疏問題.數值結果表明:在微機486 / 33上就能解較大規模的凸二次規劃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
本文分兩部分,第一部分研究求解邊界約束非凸二次規劃問題的整體最優解的分支定界演算法。The error estimation of a rational cubic spline
帶有界約束非凸二次規劃問題的整體優化方法
分享友人