General programmes for least pth and near minimax approximation

DOI10.1080/00207727408920149MaRDI QIDQ4773205zbMATH OpenOpenAlexFDO

Authors

Publication date 1974

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical smoothing, curve fitting (65D10) Algorithms in computer science (68W99)

Cites work

• A Rapidly Convergent Descent Method for Minimization
• A new approach to variable metric algorithms
• Necessary Conditions for a Minimax Approximation
• Rational Chebyshev approximation
• Rational Chebyshev approximation by Remes' algorithms

Cited in

(1)

• An active set smoothing method for solving unconstrained minimax problems

This page was built for publication: General programmes for least pth and near minimax approximation

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