首页 | 本学科首页   官方微博 | 高级检索  
     


Convex piecewise-linear fitting
Authors:Alessandro Magnani  Stephen P. Boyd
Affiliation:(1) Electrical Engineering Department, Stanford University, Stanford, CA 94305, USA
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.
Keywords:Convex optimization  Piecewise-linear approximation  Data fitting
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号