Practical application of a penalty function approach to constrained minimax optimization

Abstract A practical, penalty function approach to solving constrained minimax problems is applied here. In essence, this approach reformulates the constrained minimax problem as an unconstrained minimax problem. A recently proposed optimization algorithm called grazor search is used to solve the reformulated unconstrained minimax problem. The proposed approach can handle inequality constraints-parameter constraints in particular. A practical transmission-line filter example with parameter constraints illustrates the results.