In this paper, a type of Min Max problem with constraints has been discussed and a generalized projection method has been given for solving this problem.
讨论一类带约束的极大极小问题并给出一个广义投影型的算法，利用问题的特性而使算法有较简单的结构。
Expect one about a min/max problem, something about Lagrange multipliers, something about the chain rule and something about constrained partial derivatives.
有一个极值问题，也有关于拉格朗日乘数法的，链式法则也会有的,约束条件下偏导数当然不会漏掉。
Meanwhile, KS function is suitable for dealing with the optimization of Min-Max problem.
同时指出，KS函数很适合求解最小-最大类型的优化问题。
应用推荐