Well‐behaved penalty functions for constrained optimization
- 1 March 1990
- journal article
- research article
- Published by Taylor & Francis in Journal of the Chinese Institute of Engineers
- Vol. 13 (2) , 157-165
- https://doi.org/10.1080/02533839.1990.9677243
Abstract
This paper proposes a penalty function to be used for constrained optimization problems. The proposed penalty function is based on two special types of the hyperbolic curve. For the equality constraint, the penalty function is √x 2 + t2 , where x= pg(X), g(X)=0 is the constraint, t is a shape parameter, p is a scale factor, and X contains the design variables. For the inequality constraint, the penalty function is √x 2 + t2 – x, where x = pg(X), and p > 0 is the constraint for g(X) > 0, or p < 0 for g(X)≤ 0. These penalty functions have the advantages of being defined everywhere, accurate and differentiable. Two extended penalty functions are also proposed to dominate the infinite negative objective function in some cases. One is of the power type, another is of the exponential type. These two extended penalty functions are continuous up to their second derivatives. Therefore, they can be used in almost all of the optimization methods.Keywords
This publication has 14 references indexed in Scilit:
- Applications of a Quadratic Extended Interior for Structural Optimization Penalty FunctionAIAA Journal, 1976
- On implementation of the extended interior penalty functionInternational Journal for Numerical Methods in Engineering, 1976
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained ProblemsThe Computer Journal, 1966
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964
- Function minimization by conjugate gradientsThe Computer Journal, 1964
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained SystemsOperations Research, 1961
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959
- Variational methods for the solution of problems of equilibrium and vibrationsBulletin of the American Mathematical Society, 1943