最優性條件 的英文怎麼說

中文拼音 [zuìyōuxìngtiáojiàn]
最優性條件 英文
optimality condition
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 條 : Ⅰ名詞1 （細長的樹枝） twig 2 （條子） slip; strip 3 （分項目的） item; article 4 （層次; 秩序; 條...
  • 件 : Ⅰ量詞（用於個體事物） piece; article; item Ⅱ名詞1. （指可以一一計算的事物） 2. （文件） letter; correspondence; paper; document
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 條件 : 1. （客觀的因素） condition; term; factor 2. （提出的要求） requirement; prerequisite; qualification
  1. Optimality conditions of the nonlinear bilevel programming problem

    一類非線性雙層規劃問題的最優性條件
  2. Optimality conditions for symmetrically differentiable semi - infinite programming under generalized uniform v - type i invexity

    型多目標半無限規劃的最優性條件
  3. At first, on the basis of the sufficient and necessary optimality conditions, we give a certain algorithm to compute the trust region subproblem ; then, we draw out a different scheme for parameter vector in cim

    在分析子問題最優性條件的基礎上，我們給出了錐函數模型信賴域子問題的求解演算法；並從數據擬合的角度提出了對錐模型中參數向量的另外一種選擇方案。
  4. Under the assuption of generalized subconvexlikeness, the optimality conditions of set - valued optimization problems in linear space are established by using obtained gordan - farkas type alternative theorem. under the assuption of near subconvexlikeness and - generalized convexity, the optimality conditions of set - valued optimization problems in linear topological space are established by using alternative theorem of near subconvexlikeness and obtained farkas - minkowski type alternative theorem. the concepts of super efficient solution and - super efficient solution are defined in normed space, and the optimality conditions of set - valued optimization problems are established under the assuption of semi - preinvexity

    在廣義次似凸性假設下，利用已獲得的gordan - farkas型的擇一性定理，建立了線性空間中集值優化問題的最優性條件。在近次似凸和-廣義錐凸性假設下，利用近次似凸集值映射的擇一性定理和已獲得的farkas - minkowski型的擇一性定理，建立了線性拓撲空間中集值優化問題的最優性條件。
  5. Li - ping pang, ming - zheng wang and zun - quan xia, first order necessary optimality conditions for a class of nonsmooth generalized semi - infinite optimization problems

    董玉林，龐麗萍，夏重航，監督學習問題中的最優性條件與數值試驗，高等學校計算數學學報. 27 （ 2005 ） ， 362 - 367
  6. The optimality conditions of the constraint nonsmooth programming problem are discussed on r, under - vexity assumptions, by using - subdifferentiation

    摘要藉助于次微分，在凸條件下，在一維空間r上討論了約束非光滑優化問題的最優性條件。
  7. This paper is organized as follows : in the first chapter, we briefly review the origin and development of the nonlinear optimization problems and lc1 optimization problems, and the optimization conditions were presented

    第一章簡單介紹了非線性最優化問題以及lc ~ 1優化問題的產生與發展，並給出了lc ~ 1優化問題的最優性條件。
  8. In recent years, set - valued optimization make much progress. in chapter 5, based on clarke tangent cone, we establish epiderivative of a class of set - valued maps and its properties. and furthermore, sufficiency ( or neccessity ) optimization conditions of set - valued optimization are also obtained

    在第5章中，針對近幾年發展起來的集值優化，基於clarke切錐利用epigraph建立了一類集值映射的epi -導數並討論它的一些性質，同時給出集值優化的充分（或必要）的最優性條件。
  9. 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 }二次規劃的全局最優性條件，提出了一種最優解元素的判斷準則，得到了一個規模較小的離散系數濾波器設計問題。
  10. Global optimal conditions with inequality constraints

    帶有不等式約束的全局最優性條件
  11. The optimal condition for a class of vector extremum problem in ordered linear space

    序線性空間一類向量極值問題的最優性條件
  12. The optimality conditions of benson proper efficient solution for differetiable vector extremum problems

    真有效解的最優性條件
  13. Based on the optimality conditions and complementarity conditions for socp, a new merit function is defined in the algorithm

    基於二次錐規劃的最優性條件和互補條件，定義了一個新的價值函數。
  14. The resulted smooth merit function is convex and its optimal conditions contain a set of extra parameters, compared with the usual perturbed complementarity conditions

    與一般內點法中的攝動互補條件相比，其最優性條件含有一組中心化參數。
  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. Optimality conditions of strict efficient solutions for the vector optimization problems

    向量優化問題的嚴有效解的最優性條件
  17. Optimatity conditions of vector set - valued optimization problems

    向量集值優化問題的最優性條件
  18. Optimality conditions for convex composite multiobjective optimization problem

    凸復合多目標優化問題的最優性條件
  19. The vector extreme problems with the set constraint in the ordered linear topological spaces are studied. the necessary and sufficient optimality conditions are established

    在序線性拓撲空間里研究了含有集約束向量極值問題的最優性條件，並建立了充分性和必要性條件
  20. Optimality conditions and duality of - weak efficient solutions for a class of multiobjective fractional programming

    弱有效解的最優性條件和對偶
分享友人
分享到 Line

分享到臉書