非凸規劃法 的英文怎麼說

中文拼音 [fēitūguīhuàfǎ]
非凸規劃法 英文
non-convex programming
  • 非 : Ⅰ名詞1 （錯誤） mistake; wrong; errors 2 （指非洲） short for africa 3 （姓氏） a surname Ⅱ動詞1 ...
  • 凸 : Ⅰ動詞（高出） bulge; protrude Ⅱ形容詞（高於周圍） protruding; raised
  • 規 : Ⅰ名詞1 （畫圓形的工具） instrument for drawing circles 2 （規則; 成例） rule; regulation 3 [機械...
  • 劃 : 劃動詞1 （撥水前進） paddle; row 2 （合算） be to one s profit; pay 3 （用尖銳的東西在別的東西上...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. Theory of portfolio optimization is an important part of the modern ? nance in - vestment theories, which uses mathematical facilities such as convex analysis, random analysis, nonsmooth analysis, ( nonlinear ) programming etc, combined with the mean - variance method the basic method of modern portfolio theory. by setting up mathe - matical models, discussed the investment rules of ? nance market and o ? ered theoretic guide for investors

    投資組合優化理論是現代金融投資理論的重要組成部分，它運用凸分析、隨機分析、非光滑優化、 （非）線性規劃等數學工具，並與現代投資組合理論的基本方法均值方差方法相結合，通過建立數學模型討論金融市場投資規律並為個人或機構投資者提供理論指導。
  2. In this thesis, the optimality sufficiency conditions and duality theory are discussed in multiobjective nonlinear programming involving ( f, a, p, d ) - convexity and generalized ( f, a, p, d ) - convexity. at that time, an algorithm is discussed for nonlinear multiobjective problem

    本文主要討論了（ f ， ， ， d ） -凸及廣義（ f ， ， ， d ） -凸條件下非線性多目標規劃問題的最優性充分條件和對偶理論，同時，也探討了求解具有線性等式約束的非線性多目標規劃問題的一種新演算法。
  3. 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上就能解較大規模的凸二次規劃
  4. 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

    本文分兩部分，第一部分研究求解邊界約束非凸二次規劃問題的整體最優解的分支定界演算法。
  5. This paper consists of three parts as follows, 1. a nonsmooth convex programming is relaxed to a smooth convex programming by using a cutting - plane, which is constructed by subgradient. an algorithm based on the cutting - plane is presented. in this way, a cutting plane algorithm and it ' s convergence for semide ? nite programming are provided

    利用次微分的概念給出了一種非光滑凸規劃割平面的構造技巧，找到了半定規劃可行域的一個支撐超平面，從而給出了求解半定規劃的一種割平面演算法
  6. Non - convexity is in general the main feature of the difficulties for solving these models for wastewater treatment network optimization

    它們是具有非凸性的復雜非線性數學規劃問題，用現有的方法進行求解不能保證得到全局最優解。
  7. The error estimation of a rational cubic spline

    帶有界約束非凸二次規劃問題的整體優化方法
  8. We solved multiobject nonconvex programming by means of homotopy - interior method and got the minimum weak effect solution under quasi - normal cone condition ; meanwhile we proved the convergence of this method

    摘要利用同倫內點演算法求解多目標非凸規劃在擬錐條件下的最小弱有效解，並證明了演算法的大范圍收斂性。
  9. With the homotopy method we solved the non - convex nonlinear programming with equality and inequality constrains

    摘要使用同倫演算法研究混合約束的非凸非線性規劃問題。
分享友人
分享到 Line

分享到臉書