Abstract
The problem of calculating the best approximating straight line—in the sense of Chebyshev—to a finite set of points inRn is considered. First-and second-order optimality conditions are derived and analysed. Lipschitz optimization techniques can be used to find a global minimizer.
| Original language | English |
|---|---|
| Pages (from-to) | 187-196 |
| Journal | Constructive approximation |
| Volume | 10 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1994 |
Fingerprint
Dive into the research topics of 'Chebyshev approximation of a point set by a straight line'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver