convexity theorem 中文意思是什麼
-
Sometimes different combinations in the concavity and convexity of functions may construct a new theorem
函數凹凸性的不同組合往往可以構成一個新的極大極小定理。 -
A minimax theorem generally involves three assumption conditions : space structures on sets x and y, the continuity of the functions and the concavity and convexity of functions
一個極大極小定理一般涉及三個假設條件：集合x和y的空間結構，函數的連續性和函數的凹凸性。 -
This completes the proof of the convexity theorem.
這就完成了凸定理的證明。 -
In the higher mathematics category, routine methods to work out the proof of an inequation are a flexible use of mathematical knowledge like monotonicity of functions, extremum values, maximum and minimum values, convexity function, medium value theorem, taylor equation, holder inequation, schwarz inequation, and the analysis, formation and transformation of inequation problems as well
摘要在高等數學?疇中，靈活運用函數的單調性、極值、最值、凸性函數、以及中值定理與泰勒公式、赫爾德不等式、施瓦茲不等式等數學知識，對不等式問題進行分析、構造與轉化，是解決不等式的證明問題的常用方法。 -
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型的擇一性定理，建立了線性拓撲空間中集值優化問題的最優性條件。 -
Under the assuption of - generalized convexity, relative interior is introduced, and a farkas - minkowski type alternative theorem is proved
在-廣義錐凸性假設下，引進相對內部，證明了farkas - minkowski型的擇一性定理。
分享友人