Two curve Chebyshev approximation and its application to signal clustering

DOI10.1016/j.amc.2019.03.021zbMath1428.94038arXiv1807.11701OpenAlexW2887126970MaRDI QIDQ2009520

Yanyan Li

Publication date: 29 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.11701

zbMATH Keywords

nonsmooth analysislinear programmingconvex analysisChebyshev approximationsignal clustering

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) Best approximation, Chebyshev systems (41A50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• ElemStatLearn
• clusfind

Cites Work

• A new polynomial-time algorithm for linear programming
• An interior point method and Sherman--Morrison formula for solving large scale convex quadratic problems with diagonal Hessians
• Finding Groups in Data
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two curve Chebyshev approximation and its application to signal clustering