Conditions for a minimax optimum

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 Chebyshe...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuit theory Vol. 18; no. 4; pp. 476 - 479
Main Author: Bandler, J.
Format: Journal Article
Language:English
Published: IEEE 01.01.1971
Subjects:
Algorithm design and analysis
Approximation algorithms
Chebyshev approximation
Computer networks
Convergence
Design optimization
Minimax techniques
Network synthesis
Optimization methods
Testing
ISSN:0018-9324
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9324
DOI:10.1109/TCT.1971.1083301