极小极大问题是一类重要的非光滑优化问题。
Minimax problem is a kind of important optimization problems.
提出了求解一类带一般凸约束的复合非光滑优化的信赖域算法。
In this paper, we propose a new trust region algorithm for solving a class of composite nonsmooth optimization subject to convex constraints.
给出了填充函数的区间扩张，并提出了求解该非光滑优化问题的区间填充函数算法。
It gives an interval enclosure for filled function and presents an interval filled function algorithm to solve this nonsmooth optimization.
应用推荐