It gives an interval enclosure for filled function and presents an interval filled function algorithm to solve this nonsmoothoptimization.
给出了填充函数的区间扩张,并提出了求解该非光滑优化问题的区间填充函数算法。
2
In this paper, we propose a new trust region algorithm for solving a class of composite nonsmoothoptimization subject to convex constraints.
提出了求解一类带一般凸约束的复合非光滑优化的信赖域算法。
3
This paper discusses a model algorithm for composite nonsmoothoptimization problems and proves that the algorithm holds global convergence and in the meantime the convergent rate is superlinear.