期刊
OPTIMIZATION AND ENGINEERING
卷 10, 期 1, 页码 1-17出版社
SPRINGER
DOI: 10.1007/s11081-008-9045-3
关键词
Convex optimization; Piecewise-linear approximation; Data fitting
类别
资金
- MARCO Focus Center for Circuit and System Solutions [2003-CT-888]
We consider the problem of fitting a convex piecewise-linear function, with some specified form, to given multi-dimensional data. Except for a few special cases, this problem is hard to solve exactly, so we focus on heuristic methods that find locally optimal fits. The method we describe, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on data that can be fit well by a convex function. We focus on the simplest function form, a maximum of a fixed number of affine functions, and then show how the methods extend to a more general form.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据