Abstract
A class of generalized variable penalty formulations for solving nonlinear programming problems is presented. The method poses a sequence of unconstrained optimization problems with mechanisms to control the quality of the approximation for the Hessian matrix, which is expressed in terms of the constraint functions and their first derivatives. The unconstrained problems are solved using a modified Newton's algorithm. The method is particularly applicable to solution techniques where an approximate analysis step has to be used (e.g., constraint approximations, etc.), which often results in the violation of the constraints. The generalized penalty formulation contains two floating parameters, which are used to meet the penalty requirements and to control the errors in the approximation of the Hessian matrix. A third parameter is used to vary the class of standard barrier or quasibarrier functions, forming a branch of the variable penalty formulation. Several possibilities for choosing such floating parameters are discussed. The numerical effectiveness of this algorithm is demonstrated on a relatively large set of test examples.
Similar content being viewed by others
References
Lootsma, F. A.,A Survey of Methods for Solving Constrained Minimization Problems via Unconstrained Minimization, Numerical Methods for Nonlinear Optimization, Edited by F. A. Lootsma, Academic Press, New York, New York, pp. 313–347, 1972.
Davies, D., andSwann, W. H.,Review of Constrained Optimization, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, 1969.
Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.
Haftka, R. T., andStarnes, J. H., Jr.,Applications of a Quadratic Extended Interior Penalty Function for Structural Optimization, AIAA Journal, Vol. 14, pp. 718–728, 1976.
Casis, J. H., andSchmit, L. A.,On Implementation of the Extended Interior Penalty Function, International Journal for Numerical Methods in Engineering, Vol. 10, pp. 3–23, 1976.
Gill, P. E., andMurray, W.,Quasi-Newton Methods for Unconstrained Optimization, Journal of the Institute of Mathematics and Applications, Vol. 9, pp. 91–108, 1972.
Fletcher, R., andPowell, M. J. D.,A Rapidly Convergent Descent Method for Minimization, Computer Journal, Vol. 6, pp. 163–168, 1963.
Mathews, A., andDavies, D.,A Comparison of Modified Newton Methods for Unconstrained Optimization, Computer Journal, Vol. 14, pp. 293–294, 1971.
Hamala, M.,Quasi-Barrier Methods for Convex Programming, Survey of Mathematical Programming, Edited by A. Prekopa, North-Holland Publishing Company, Amsterdam, Holland, 1979.
Miele, A., Coggins, C. M., andLevy, A. V.,Updating Rules for the Penalty Constant Used in the Penalty Function Method for Mathematical Programming Problems, Ricerche di Automatica, Vol. 3, No. 2, 1972.
Osborne, M. R., andRyan, D. M.,On Penalty Function Methods for Nonlinear Programming Problems, Journal of Mathematical Analysis and Applications, Vol. 31, pp. 559–578, 1970.
Betts, J. T.,An Improved Penalty Function Method for Solving Constrained Parameter Optimization Problems, Journal of Optimization Theory and Applications, Vol. 16, Nos. 1 and 2, 1975.
Kavalie, D., andMoe, J.,Automated Design of Frame Structures, Journal of the Structural Division, ASCE, Vol. 97, No. ST1, 1971.
Himmelblau, D. M.,Applied Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1972.
Betts, J. T.,An Accelerated Multiplier Method for Nonlinear Programming, Journal of Optimization Theory and Applications, Vol. 21, No. 2, 1977.
Betts, J. T.,A Gradient Projection-Multiplier Method for Nonlinear Programming, Journal of Optimization Theory and Applications, Vol. 24, No. 4, 1978.
Author information
Authors and Affiliations
Additional information
Communicated by A. V. Fiacco
The author is thankful for the constructive suggestions of the referees.
Rights and permissions
About this article
Cite this article
Prasad, B. A class of generalized variable penalty methods for nonlinear programming. J Optim Theory Appl 35, 159–182 (1981). https://doi.org/10.1007/BF00934574
Issue Date:
DOI: https://doi.org/10.1007/BF00934574