Premium
Approximate direct‐search minimax circuit optimization
Author(s) -
SussmanFort Stephen E.
Publication year - 1989
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620280208
Subject(s) - minimax , simplex , mathematical optimization , simple (philosophy) , minimax approximation algorithm , mathematics , function (biology) , optimization problem , algorithm , computer science , combinatorics , philosophy , epistemology , evolutionary biology , biology
A direct‐search optimization strategy, involving pattern‐searches, pattern‐moves and a simplex algorithm, has been applied to a number of frequency‐domain circuit problems. We show that an approximate minimax result can be obtained with our simple approach, which includes using a modified minimax error function. In the examples attempted, the method comes quite close to the accuracy, if not the efficiency, of true minimax optimizers, and yields an accuracy as good as or better than a least‐ p th ( p = 10) gradient optimizer. The method is broadly appropriate wherever it is difficult or inconvenient to calculate the gradients required for conventional minimax optimization.