点击次数：

论文类型：期刊论文

发表时间：2018-07-01

发表刊物：JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION

收录刊物：SCIE

卷号：14

期号：3

页面范围：1143-1155

ISSN号：1547-5816

关键字：Nonsmooth optimization; proximal bundle method; subgradient; localization set; Chebychev center

摘要：Motivated by the proximal-like bundle method [K. C. Kiwiel, Journal of Optimization Theory and Applications, 104(3) (2000), 589-603.], we establish a new proximal Chebychev center cutting plane algorithm for a type of nonsmooth optimization problems. At each step of the algorithm, a new optimality measure is investigated instead of the classical optimality measure. The convergence analysis shows that an epsilon-optimal solution can be obtained within O (1/epsilon(3)) iterations. The numerical result is presented to show the validity of the conclusion and it shows that the method is competitive to the classical proximal-like bundle method.