A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Convex piecewise-linear fitting
Abstract 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.
Convex piecewise-linear fitting
Abstract 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.
Convex piecewise-linear fitting
Magnani, Alessandro (author) / Boyd, Stephen P. (author)
2008
Article (Journal)
English
Convex piecewise-linear fitting
| Springer Verlag | 2008
Sampling piecewise convex unmixing and endmember extraction
| Online Contents | 2013
Sampling piecewise convex unmixing and endmember extraction
| Online Contents | 2013
Piecewise Convex Multiple-Model Endmember Detection and Spectral Unmixing
| Online Contents | 2013
Piecewise Linear Branch Prediction
| British Library Conference Proceedings | 2005