A Unified Review of Optimization

Abstract

The main objective of this paper is to give a survey of recent automatic optimization methods which either have found or should find useful application in the area of computer-aided network design. Huang's family of algorithms for unconstrained optimization is reviewed. The Fletcher method and the Charalambous family of algorithms for unconstrained optimization, which abandon the "full linear search," are presented. Special emphasis is devoted to algorithms by Bandler and Charalambous on least pth and minimax optimization which can be readily programmed and used. Due to work by Bandler and Charalambous, it is shown how constrained minimax problems can be solved exactly as unconstrained minimax problems by using a new approach to nonlinear programming. The application of minirnax optimization on the design of lumped-distributed active filters, problems for future investigation, and a select list of references are also included.