Penalty Function versue Nonpenalty Function Methods for Constrained Nonlinear Programming Problems.
RESEARCH ANALYSIS CORP MCLEAN VA
Pagination or Media Count:
The relative merits of using sequential unconstrained methods for solving minimize fx subject to g sub i x or 0, i 1,...,m, h sub j x 0, j 1,...,p versus methods which handle the constraints directly are explored. Nonlinearly constrained problems are emphasized. Both classes of methods are analyzed as to parameter selection requirements, convergence to first and second-order Kuhn-Tucker Points, rate of convergence, matrix conditioning problems and computations required. Author
- Operations Research