Theory of generalized least pth approximation
- 1 May 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 19 (3) , 287-289
- https://doi.org/10.1109/TCT.1972.1083448
Abstract
A unified discussion of leastpth approximation as it relates to optimal computer-aided design of networks and systems is presented. General objective functions are proposed and their properties discussed. The main result is that a wider variety of design problems and a wider range of specifications than appear to have been considered previously from the least pth point of view should now be tractable.Keywords
This publication has 9 references indexed in Scilit:
- Survey of Circuit-Oriented Optimization TechniquesIEEE Transactions on Circuit Theory, 1971
- Least p th and minimax objectives for automated network designElectronics Letters, 1970
- Optimization Methods for Computer-Aided DesignIEEE Transactions on Microwave Theory and Techniques, 1969
- Least pth ApproximationIEEE Transactions on Circuit Theory, 1969
- Optimization in engineering designProceedings of the IEEE, 1967
- Optimal Design of Filters with Bounded, Lossy ElementsIEEE Transactions on Circuit Theory, 1966
- Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear ProgrammingManagement Science, 1964
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963