An algorithm for discrete linear \(L_ p\) approximation
type: Item
instance of: scholarly article
title: An algorithm for discrete linear \(L_ p\) approximation
zbMATH Open document ID: 0463.65041
DOI: 10.1007/BF01395812
author: Jürgen Fischer
published in: Numerische Mathematik
publication date: 1981-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/132752
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 41A30
zbMATH DE Number: 3725600
zbMATH Keywords: discrete Lp approximation
zbMATH Keywords: Newton method
zbMATH Keywords: dual problem
zbMATH Keywords: least squares methods
MaRDI profile type: Publication
cites work: A quadratic programming algorithm
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
cites work: The calculation of linear best Lp approximations
cites work: Robust Estimation of Straight Line Regression Coefficients by Minimizing pth Power Deviations
cites work: Q5589748
cites work: Computational experiences with discrete L\(_p\)-approximation
cites work: Q5652137
cites work: The Calculation of Best Linear One-Sided L p Approximations
cites work: On the convergence of an algorithm for discrete \(L_p\) approximation
description: scientific article; zbMATH DE number 3725600