Nonlinear programming using minimax techniques |
| |
Authors: | J W Bandler C Charalambous |
| |
Institution: | (1) Department of Electrical Engineering, McMaster University, Hamilton, Ontario, Canada;(2) Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada |
| |
Abstract: | A minimax approach to nonlinear programming is presented. The original nonlinear programming problem is formulated as an unconstrained minimax problem. Under reasonable restrictions, it is shown that a point satisfying the necessary conditions for a minimax optimum also satisfies the Kuhn-Tucker necessary conditions for the original problem. A leastpth type of objective function for minimization with extremely large values ofp is proposed to solve the problem. Several numerical examples compare the present approach with the well-known SUMT method of Fiacco and McCormick. In both cases, a recent minimization algorithm by Fletcher is used.This paper is based on work presented at the 5th Hawaii International Conference on System Sciences, Honolulu, Hawaii, 1972. The authors are greatly indebted to V. K. Jha for his programming assistance and J. H. K. Chen who obtained some of the numerical results. This work was supported in part by the National Research Council of Canada under Grant No. A7239, by a Frederick Gardner Cottrell Grant from the Research Corporation, and through facilities and support from the Communications Research Laboratory of McMaster University. |
| |
Keywords: | Nonlinear programming minimax approximation least-square methods function minimization penalty function methods |
本文献已被 SpringerLink 等数据库收录! |
|