Answers are grounded in this paper and cite their sources.
This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A straightforward geometrical interpretation is presented. The results may be used to test for convergence in computer-aided network optimization, in tests for optimality in the Chebyshev sense of any given design, and to gain insight which may be helpful in developing minimax approximation algorithms.
No takes yet. Share an insight, caveat, or question.
J.W. Bandler (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: