The proximal Chebychev center cutting plane algorithm for convex additive functions

被引：0
|
作者：
Adam Ouorou
机构：
[1] Orange Labs Research,
来源：
Mathematical Programming | 2013年 / 140卷
关键词：
Nondifferentiable optimization; Network flows; Large-scale convex programming; Routing problems in telecommunications; 90C30; 90C25; 65K05;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The recent algorithm proposed by the author for convex nonsmooth optimization is tailored to the case where the objective function is additive. We highlight aspects where this specialization differs from ignoring the structure of the objective function. To assess the approach, we consider two different nonlinear multicommodity flows applications in telecommunications including some comparison with a proximal bundle algorithm.
引用
收藏
页码：163 / 187
页数：24
相关论文
共 50 条
12345