원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.9 No.5
2016.05
pp.31-40
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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.
목차
Abstract
1. Introduction
2. Derivation and Properties of Approximation Function
3. Algorithm and its Convergence
4. Numerical Experiments
5. Conclusion
Acknowledgment
References
1. Introduction
2. Derivation and Properties of Approximation Function
3. Algorithm and its Convergence
4. Numerical Experiments
5. Conclusion
Acknowledgment
References
저자정보
참고문헌
자료제공 : 네이버학술정보