Skip to main content
Log in

Iterative determination of parameters for an exact penalty function

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

Abstract

As an approach to solving nonlinear programs, we study a class of functions known to be exact penalty functions for a proper choice of the parameters. The goal is to iteratively determine the correct parameters. A basic algorithm has been developed. We have proved that this algorithm converges to a global solution for concave programs and, in the limited computational tests performed to date, it has always converged to at least a local solution for nonconcave programs also.

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. Murray, W.,Ill Conditioning in Barrier and Penalty Functions Arising in Constrained Nonlinear Programming, Princeton Symposium on Mathematical Programming, Princeton, New Jersey, 1967.

  3. Fletcher, R.,A Class of Methods for Nonlinear Programming with Termination and Convergence Properties, Integer and Nonlinear Programming, Edited by J. Abadie, North Holland Publishing Company, Amsterdam, The Netherlands, 1970.

    Google Scholar 

  4. Fletcher, R., andLill, S. A.,A Class of Methods for Nonlinear Programming, II, Computational Experience, Nonlinear Programming, Edited by J. B. Rosen, Academic Press, New York, New York, 1970.

    Google Scholar 

  5. Lill, S. A.,Generalization of an Exact Method for Solving Constrained Problems to Deal with Inequality Constraints, Numerical Methods for Non-Linear Optimization, Edited by F. A. Lootsma, Academic Press, New York, New York, 1972.

    Google Scholar 

  6. Fletcher, R.,An Exact Penalty Function for Nonlinear Programming with Inequalities, Atomic Energy Research Establishment, Harwell, England, T.P.478, 1972.

    Google Scholar 

  7. Evans, J. P., andGould, F. J.,On Using Equality Constraint Algorithms for Inequality Constrained Problems, Mathematical Programming, Vol. 2, No. 3, 1972.

  8. Zangwill, W. I.,Nonlinear Programming via Penalty Functions, Management Science, Vol. 13, No. 5, 1967.

  9. Pietrzykowski, T.,An Exact Potential Method for Constrained Maxima, SIAM Journal on Numerical Analysis, Vol. 6, No. 2, 1969.

  10. Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, No. 5, 1969.

  11. Gould, F. J., andHowe, S.,A New Result on Interpreting Lagrange Multipliers as Dual Variables, University of North Carolina Institute of Statistics, Mimeo Series No. 738, 1971.

  12. Hartman, J. K.,Conditions Under Which a Penalty Function Algorithm is Well Defined, Naval Postgraduate School, Technical Report No. NPS55HH73, Monterey, California, 1973.

  13. Mylander, W. C., Holmes, R. L., andMcCormick, G. P.,A Guide to SUMT, Version 4, Research Analysis Corporation, Report No. RAC-P-63, 1971.

  14. Colville, A. R.,A Comparative Study on Nonlinear Programming Codes, IBM, Technical Report No. 320–2947, 1968.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by G. L. Nemhauser

The author would like to thank the referee whose suggestions made it possible to improve significantly the presentation of the paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hartman, J.K. Iterative determination of parameters for an exact penalty function. J Optim Theory Appl 16, 49–66 (1975). https://doi.org/10.1007/BF00935623

Download citation

  • Issue Date:

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

Key Words

Navigation