An algorithm for discrete linear \(L_ p\) approximation

DOI10.1007/BF01395812zbMath0463.65041MaRDI QIDQ1153653

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

dual problemNewton methodleast squares methodsdiscrete Lp approximation

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms ⋮ The \(\ell_p\)-solution of the linear matrix equation \(AX+YB=C\) ⋮ The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of an algorithm for discrete \(L_p\) approximation
• Computational experiences with discrete L\(_p\)-approximation
• A quadratic programming algorithm
• Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• The Calculation of Best Linear One-Sided L p Approximations
• The calculation of linear best Lp approximations
• Robust Estimation of Straight Line Regression Coefficients by Minimizing pth Power Deviations

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