Skip to main content
Log in

An improved penalty function method for solving constrained parameter optimization problems

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

An effective algorithm is described for solving the general constrained parameter optimization problem. The method is quasi-second-order and requires only function and gradient information. An exterior point penalty function method is used to transform the constrained problem into a sequence of unconstrained problems. The penalty weightr is chosen as a function of the pointx such that the sequence of optimization problems is computationally easy. A rank-one optimization algorithm is developed that takes advantage of the special properties of the augmented performance index. The optimization algorithm accounts for the usual difficulties associated with discontinuous second derivatives of the augmented index. Finite convergence is exhibited for a quadratic performance index with linear constraints; accelerated convergence is demonstrated for nonquadratic indices and nonlinear constraints. A computer program has been written to implement the algorithm and its performance is illustrated in fourteen test problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.

    Google Scholar 

  2. Betts, J. T., andCitron, S. J.,Approximate Optimal Control of Distributed Parameter Systems, AIAA Journal, Vol. 10, No. 1, 1972.

  3. Betts, J. T.,An Approximation Technique for Determining the Optimal Control of a Distributed Parameter System, Purdue University, Department of Aeronautics, Astronautics, and Engineering Science, Ph.D. Thesis, 1970.

  4. Johnson, F. T.,Approximate Finite-Thrust Trajectory Optimization, AIAA Journal, Vol. 7, No. 6, 1969.

  5. Taylor, L. W., Jr., Smith, H. J., andIliff, K. W.,Experience Using Balakrishnan's Epsilon Technique to Compute Optimum Flight Profiles, Journal of Aircraft, Vol. 7, No. 2, 1970.

  6. Powell, M. J. D.,A Method for Nonlinear Constraints in Minimization Problems, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, 1969.

    Google Scholar 

  7. Miele, A., Coggins, G. 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.

  8. Hanson, R. J., andLawson, C. L.,Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems, Mathematics of Computation, Vol. 23, No. 108, 1969.

  9. Davidon, W. C.,Variance Algorithm for Minimization, The Computer Journal, Vol. 10, No. 4, 1968.

  10. Broyden, C. G.,The Convergence of Single-Rank Quasi-Newton Methods, Mathematics of Computation, Vol. 24, No. 110, 1970.

  11. Murtagh, B. A., andSargent, R. W. H.,A Constrained Minimization Method with Quadratic Convergence, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, 1969.

    Google Scholar 

  12. Betts, J. T.,An Effective Method for Solving Constrained Parameter Optimization Problems, Aerospace Corporation, Report No. TR-0073(3450-10), El Segundo, California, 1972.

  13. Fletcher, R., andPowell, M. J. D.,A Rapidly Convergent Descent Method for Minimization, The Computer Journal, Vol. 6, No. 2, 1963.

  14. Pickett, H. E.,A Contribution to the Thaumaturgy of Nonlinear Programming, Aerospace Corporation, Report No. ATR-71(S9990)-1, San Bernardino, California, 1970.

  15. Colville, A. R.,A Comparative Study on Nonlinear Programming Codes, IBM, New York Scientific Center, Report No. 320-2949, 1968.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by H. Y. Huang

This paper was prepared under AF Contract No. F04701-72-C-0073.

The author expresses his appreciation to Dr. H. E. Pickett for his continuing support in the theoretical and practical development of the BEST computer program. In addition, the recursive method for updating the Hessian of the penalty function was developed jointly with Drs. Pickett and J. L. Searcy and is included here with their permission. Finally, the author would like to acknowledge the contribution made by the stimulating environment of an optimal control seminar held at The Aerospace Corporation since 1970. Principal members of the seminar have been Drs. Pickett, Searcy, R. W. Reid, and the author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Betts, J.T. An improved penalty function method for solving constrained parameter optimization problems. J Optim Theory Appl 16, 1–24 (1975). https://doi.org/10.1007/BF00935620

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00935620

Key Words

Navigation