次最優化問題 的英文怎麼說

中文拼音 [cìzuìyōuhuàwèntí]
次最優化問題 英文
secondary optimization problem
  • 次 : Ⅰ名詞1 （次序; 等第） order; sequence 2 [書面語] （出外遠行時停留的處所） stopping place on a jou...
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. The cone - subdifferential of efficient solutions set for vector optimizations problem with perturbed order

    錐擾動向量最優化問題有效解的錐次微分
  2. In this paper, we are concerned with the sequence quadratic programming ( sqp ) methods for solving constrained optimization problems

    本文研究求解約束最優化問題的序列二次規劃演算法（ sqp演算法） 。
  3. 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型的擇一性定理，建立了線性拓撲空間中集值優化問題的最優性條件。
  4. ( 3 ) reactive power optimal of radial network is a very complex nonlinear discrete optimal problem. to ensure the speediness, feasibility and optimality, evolution algorithm is improved by combination with interior point sequence linear optimal algorithm and principle of var balance. the improved algorithm is applied to the reactive power optimization and achieves distinct effect

    （ 3 ）配網網路無功優化是一個非常復雜的非線性離散優化問題，為了保證計算結果的快速性、可行性和最優性，本文結合內點法的逐次線性優化方法，以及配網電壓調節的特點，對模擬進化優化方法進行了改進，並將該演算法應用於配網無功優化問題的求解，取得了顯著的效果。
  5. ( 2 ) reactive power optimal of hv network is a very complex nonlinear discrete optimal problem. to ensure the speediness, feasibility and optimality, evolution algorithm is improved by combination with interior point sequence linear optimal algorithm and expert knowledge of voltage / var adjustment. the improved algorithm is applied to the reactive power optimization and achieves distinct effect

    （ 2 ）高壓網路無功優化是一個非常復雜的非線性離散優化問題，為了保證計算結果的快速性、可行性和最優性，本文結合內點法的逐次線性優化方法，以及電壓無功調節的專家經驗，對模擬進化優化方法進行了改進，並將該演算法應用於無功優化問題的求解，取得了顯著的效果。
  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. Because the algorithm of support vector machine is a convex quadratic optimization problem, the local optimal solution is certainly the global optimal one

    並且，由於支持向量機演算法是一個凸二次優化問題，能夠保證找到的極值解就是全局最優解。
  8. 2 、 summarize how to design quantum state tomography, and analyze how to optimize the times of different measurements

    2 、對量子狀態層析的實驗設計進行總結，並著重分析了測量次數最優化問題。
  9. The optimality conditions of the constraint nonsmooth programming problem are discussed on r, under - vexity assumptions, by using - subdifferentiation

    摘要藉助于次微分，在凸條件下，在一維空間r上討論了約束非光滑優化問題的最優性條件。
  10. Abstract : a method named multi - times optimization is presented to solve the multi - specification optimization problem, which is difficult to solve using the variational optimal theory. in the method several demands are reduced to some sub - tasks. in every subtask a demand that can not be transformed into bound condition is taken as performance specification for optimazation, and the other demands are taken as bound conditions. by means of the method, the arrival time, number of turn, turn angle of the aircraft in the terminal area are selected as performance specification separately, and the general character of optimal flight route in the terminal area is given

    文摘:為了給飛機提供一條能滿足多種指標要求的最優飛行軌跡，針對變分最優理論難以求解多指標優化問題，提出了命名為多次優化的方法，即將多要求的優化任務分成先後相繼的多次任務，每次任務中選取一種不能邊界轉化的要求作為最優性能指標，而其餘要求轉化為邊界條件.利用這一方法以時間、轉彎次數、轉彎角度為最優性能指標給出了終端區最優飛行軌跡的一般特徵
  11. In the next section of this paper we describe a non - generational ga for multiobjective optimization problems ( mop ). in it the replacement policy is such that an offspring replaces the worst one in the current population only if it is better then it

    在將錯位交叉運算元應用於多目標優化問題求解時，本文提出一種基於非群體迭代型的小生境多目標優化遺傳演算法，即演算法迭代過程中不是更換種群全部或大部分個體，而是每次更新群體中最差的個體。
  12. Second, by combining theories of strength of laminate with ga, a new gradient free optimization method with new code strategy is discussed. the representation itself does not change the nature of the problem, but effects the searching efficiency of the algorithm. so the representation of the parameters to be optimized is a very important factor and the new code strategy is also easy used with crossover operator and variation operator in ga applications

    其次，本文根據層合板優化設計的具體問題提出了一種符號編碼方式，雖然優化參數的基因編碼表達方式並不能改變優化問題的本質，但是不同的編碼表達方式對于遺傳演算法搜索的效率和最終的優化結果有著重要的影響，因此優化參數的基因編碼表達是遺傳演算法應用於工程問題中非常關鍵的一步。
  13. The purpose of the sqp - filter method is to overcome the numerical difficulty caused by the use of large penalty factor in the sqp method

    其主要目的是為了克服求解約束最優化問題的序列二次規劃（ sqp ）演算法中罰參數太大而造成的數值計算上的困難。
  14. And then, after the analysis of strengthening the internal control system in chinese corporation businesses, the article expounds the internal control from the angles of business administration. because of the double - arrangement of internal control in chinese businesses, thus is. the internal control with both the owner ( stockholder ) and the manager as the mainbody, and of the fact that the internal control is usually manipulated by the manager in practice, the internal control of the first arran gement should be externally manifesped so as to achieve the special control effect with the aid of external control procedure. meanwhile. the optimization of capital structure should be paid attention in the internal control of corporations due to the close relationship between the internal control and the capital market. finally, the thesis suggests that the corporation internal control make the whole and the single design based on the frame of the internal control system, proposes the feasible counter - measure perfecting the internal control of corporation business consists of the standard system of internal control formulated by the government department and the compulsory internal control audit

    在此基礎之上，針對我國公司制企業加強內部控制的必要性分析，從公司治理的角度闡釋企業內部控制，由於我國公司制企業內部控制具有雙層性，即以所有者（股東）為主體的內部控制和以經營者為主體的內部控制，且實踐中內部控制為經營者所操縱，應將第一層次的內部控制外部化，藉助外部控製程序達到其特殊的控制效果；同時，根據內部控制與資本市場之間的密切關系，公司內部控制建設必須關注資本結構優化問題。對於我國公司制企業內部控制構建，應以內部控制框架為基礎，具體從整體和單項分別設計內部控制制度。最後，本文提出我國公司制企業內部控制的完善應從兩方面入手：一是由政府監管部門制止內部控制標準體系，二是對內部控制審計作出強制性的安排。
  15. The updating problems of structure models are turned into the optimization with a quadratic constraint

    該方法將模型修正問題轉化為一個帶二次約束的最優化問題。
  16. The objective function of the qp problem is a quadratic function which is an approximation of the lagrangian function of the constrained problem and the constraints of the qp problem are linear approximation of the constraints of the constrained problem

    這些二次規劃子問題的目標函數是原約束最優化問題的lagrange函數的二次某種近似，其約束條件是原約束最優化問題的線性逼近。
  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. The algorithm ' s ideal is benint from the ideal of generalize projection technique and strongly subfeasible direction algorithm. it can be approximately describe as follows : firstly, by the introductin of a perturbed parameter / /, replace the complementarity constraints with a generalized function, then ( mpec ) can be reformulated equivalently nonlinear constraints programs. secondly. combine the ideal of strongly subfeasible direction algorithm and generalized projction tech - nique, we setup a generalized strongly subfeasible direction algorithm

    本學位論文結合廣義投影技術和強次可行方向法思想，建立一個新演算法，該演算法的主要思想大致可描述如下：首先引入一個趨向於0的參數，用一個互補函數代替性質不好的互補約束，將問題等價的轉化為一般的非線性約束最優化問題，然後結合廣義投影技術和強次可行方向法思想，建立一個廣義強次可行方向演算法
  20. One is multi - dimension maximum sum of relative membership degree ; the other is staged multi - dimensional fuzzy optimization method. the first method is suitable for the static program that time is not involved, and the second method can be used to solve any multistage problem, especially for those problems time is involved, in the end, these methods are explained in detail one by one

    其中，多維多目標決策序列相對優屬度總和最大法適于解決不涉及時間維的「靜態」多階段優化問題，而多維多目標階段模糊優選動態規劃方法不僅適用於「靜態」問題，而且適用於「動態」的任一階段或任一層次的優化問題。
分享友人
分享到 Line

分享到臉書