In this paper we study the problem of solving approximate points by using the proximal bundle method based on approximate subgradients.
利用建立在近似次梯度基础上的近似Bundle算法研究了迫近点的求解问题,并给出了一类算法及算法的收敛性定理。
In this paper,the author introduces the method of polygon approximation,analyzes the stability of the method,modifies the previous error estimate,and gives a computing example.
介绍了常用的近似多边形迫近法,然后对这种方法进行了稳定性分析,修正了以前的误差估计,并给出了计算实例。