An Iterative Chebyshev Approximation Method for Network Design
- 1 December 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 15 (4), 326-336
- https://doi.org/10.1109/TCT.1968.1082855
Abstract
One of the most important problems of computeraided network design is the optimization of network characteristics by iterative calculation. In this paper, the problem of realizing a network whose transmission characteristics approximate a given function in Chebyshev sense is treated as a nonlinear programming problem, and a method of solving this problem by successively solving linear programming problems, which are derived by locally linearizing the original nonlinear programming problem, is proposed. An improvement of the method for reducing the computation time is also considered and is proved to be practical and very effective by many design examples.Keywords
This publication has 5 references indexed in Scilit:
- Computer-aided network optimization the state-of-the-artProceedings of the IEEE, 1967
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained SystemsOperations Research, 1961
- The Use of Least Squares in System DesignIRE Transactions on Circuit Theory, 1956