极小极大问题是一类重要的非光滑优化问题。
Minimax problem is a kind of important optimization problems.
给出了填充函数的区间扩张，并提出了求解该非光滑优化问题的区间填充函数算法。
It gives an interval enclosure for filled function and presents an interval filled function algorithm to solve this nonsmooth optimization.
提出复合非光滑优化问题的一类算法，并证明这种算法保持全局收敛性且敛速达到超线性。
This paper discusses a model algorithm for composite nonsmooth optimization problems and proves that the algorithm holds global convergence and in the meantime the convergent rate is superlinear.
提出复合非光滑优化问题的一类算法，并证明这种算法保持全局收敛性且敛速达到超线性。
This paper discusses a model algorithm for composite nonsmooth optimization problems and proves that the algorithm holds global convergence and in the meantime the convergent rate is superlinear.
应用推荐