An algorithm for discrete linear L_ p approximation

DOI10.1007/BF01395812MaRDI QIDQ1153653zbMATH OpenFDO

Authors Jürgen Fischer

Publication date 1981

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/132752

zbMATH Keywords

Newton methoddual problemleast squares methodsdiscrete Lp approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Approximation by other special function classes (41A30) Algorithms for approximation of functions (65D15)

Cites work

• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A quadratic programming algorithm
• Computational experiences with discrete L\(_p\)-approximation
• Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
• On the convergence of an algorithm for discrete L_p approximation
• Robust Estimation of Straight Line Regression Coefficients by Minimizing pth Power Deviations
• The Calculation of Best Linear One-Sided L p Approximations
• The calculation of linear best Lp approximations

Cited in

(5)

• The \(\ell_p\)-solution of the linear matrix equation \(AX+YB=C\)
• Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms
• Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
• On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
• The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)

This page was built for publication: An algorithm for discrete linear \(L_ p\) approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153653)