A Seemingly Polynomial-Time Algorithm for Optimal Curve Fitting by Segmented Straight Lines

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Bibtex

@inproceedings{650b5eeb4c3a459995a2acb4410c0bfc,
title = "A Seemingly Polynomial-Time Algorithm for Optimal Curve Fitting by Segmented Straight Lines",
abstract = "We consider least-squares approximation of a function of one variable by a continuous, piecewise-linear approximand that has a small number of breakpoints. This problem was notably considered by Bellman who proposed an approximate algorithm based on dynamic programming. Many suboptimal approaches have been suggested, but so far, the only exact methods resort to mixed integer programming with superpolynomial complexity growth. In this paper, we present an exact and efficient algorithm based on dynamic programming with a hybrid value function. Empirical evidence suggest that the algorithm has a polynomial time complexity.",
author = "Olof Troeng and Mattias Falt",
year = "2019",
month = "1",
day = "21",
doi = "10.1109/CDC.2018.8618654",
language = "English",
volume = "2018-December",
pages = "4091--4096",
booktitle = "2018 IEEE Conference on Decision and Control, CDC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}