duality theorem 中文意思是什麼
duality theorem
解釋
對偶定理-
Zhu had deduced generalized fenchel ' s duality theorem in [ 8 ], and further applied it to minimum discrimination information ( mdi ) problem
朱德通在文[ 8 ]中導出廣義的fenchel對偶定理，並將此定理成功地應用於帶約束的最小區別信息量問題（簡稱mdi問題） 。 -
The author discusses the duality theorem of infinite dimensional hopf algebras in braided tensor categories in the first chapter, and shows the theorem by the use of braiding diagram
本文第一章討論了辮子張量范疇中無限維hopf代數的對偶定理，應用辮子圖對此定理給出證明，得到如下結果：命題2 -
Lagrange duality and saddle points theorem for multiobjective semidefinite programming
對偶與鞍點定理 -
Nonlinear programming which is considered to be recreation of the finite dimension optimization classical theory is a very important and active branch of opsearch. characteristic of nonlinear programming lies in : allowance of complex constraints on the optimization it studies, deep analysis of optimality and duality, emphasis on summarizing theorem and establishment of feasible algorithm
非線性規劃是運籌學數學理論中特別重要而又活躍的一個分支，可認為它是有限維最優化經典理論的再創造，其特徵主要在於：所研究的最優化問題允許復雜的約束，對最優性、對偶性諸方面進行深入的分析，並強調進行理論概括和提出可行的演算法。 -
In 1982, a weak convergence theorem for nonexpensive semigroups in uniformly convex banach space was first established by miyadera and kobaysi and it was generalized to that for commutative semigroup of asymptotically nonexpansive mappings by oka [ 15 ]. feathers and dotson [ 16 ] and bose [ 1 ] gave the weak convergence theorem of asymptotically nonexpansive mappings in a uniformly convex banach space with weak continuous duality mapping by using opial ' s lemma [ 17 ]
也正是由miyadera和kobayasi於1982年首次在一致凸banach空中給出了非擴張半群的弱收斂定理，隨后，由okaf15 ]把此弱收斂定理推廣到交換半群的漸近非擴張映照。 -
With the help of the express theorem of weakly major efficient solution, the duality relation between weakly major efficient solution and sub - weakly major efficient solution is established
藉助弱較多有效解的表示定理，討論了弱較多有效解和次弱較多有效解之間的對偶關系，建立了相應的對偶定理。
分享友人