Minimax approximation from a least squares solution

DOI10.1080/1055678031000164508MaRDI QIDQ4657818zbMATH OpenOpenAlexFDO

Authors Dongdong Lei, J. C. Mason

Publication date 14 March 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/1055678031000164508

zbMATH Keywords

least squares approximationlinear programmingminimax approximationoptimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Minimax problems in mathematical programming (90C47)

Recommendations

• A new algorithm for the solution of the linear minimax approximation problem
• Erratum: Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the l_\infty Sense?
• Least \(P\)-square method
• Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
• Minimax estimation and the least squares method

Cites work

• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• An Improved Algorithm for Discrete l₁ Linear Approximation
• Using the $L_2 $-Estimator in $L_1 $-Estimation

Cited in

(5)

• Finding approximate solutions to minimax problems
• Finding a minimax with specified accuracy
• Maximization of an asymmetric utility function by the least squares
• scientific article; zbMATH DE number 3886492 (Why is no real title available?)
• Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?

This page was built for publication: Minimax approximation from a least squares solution

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