http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Kim, Moon-Hee,Kim, Gwi-Soo The Korean Society for Computational and Applied M 2010 Journal of applied mathematics & informatics Vol.28 No.5
Sufficient optimality conditions for a class of generalized non-differentiable fractional optimization programming problems are established. Moreover, we prove the weak and strong duality theorems under (V, $\rho$)-invexity assumption.
An Approximation Algorithm for Solving a Class of Minimax Problem
Yingchun Zheng 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.5
Based on the the characteristics of maximal function, the algorithm for solving Min- max problem was researched in this paper. A new differential approximation function for the nondifferentiability of the objection function was also constructed. At same time, the property of the new differential approximation function is discussed and the processes of proves show that using the new approximation function to solve the nonlinear unconstrained min-max problem is feasible and effective. The preliminary numerical example shows that the algorithm is effective, and that have a large of convergence characteristics.