期刊
OPTIMIZATION METHODS & SOFTWARE
卷 17, 期 1, 页码 1-29出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/10556780290027828
关键词
nonsmooth optimization; nondifferentiable programming; bundle methods
Bundle methods are at the moment the most efficient and promising methods for non-smooth optimization. They have been successfully used in many practical applications, for example, in economics, mechanics, engineering and optimal control. The aim of this paper is to give an overview of the development and history of the bundle methods from the seventies to the present. For simplicity, we first concentrate on the convex unconstrained case with a single objective function. The methods are later extended to nonconvex, constrained and multicriteria cases.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据