[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

An exact penalty function for nonlinear programming with inequalities

  • Published:
Mathematical Programming Submit manuscript

Abstract

It is shown how, given a nonlinear programming problem with inequality constraints, it is possible to construct an exact penalty function with a local unconstrained minimum at any local minimum of the constrained problem. The unconstrained minimum is sufficiently smooth to permit conventional optimization techniques to be used to locate it. Numerical evidence is presented on five well-known test problems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.R. Colville, “A comparative study of nonlinear programming codes”, IBM New York Scientific Center, Technical Report 320-2949 (1968).

  2. R. Fletcher, “A class of methods for nonlinear programming with termination and convergence properties”, in:Integer and nonlinear programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970).

    Google Scholar 

  3. R. Fletcher, “A FORTRAN subroutine for general quadratic programming”, UKAEA Research Group Report, AERE R.6370 (1970).

  4. R. Fletcher, “A class of methods for nonlinear programming III, Rates of convergence”, AERE Report, TP.449 (1971), in:Numerical methods for nonlinear optimization, Ed. F.A. Lootsma (Academic Press, New York, 1972).

    Google Scholar 

  5. M.R. Hestenes, “Multiplier and gradient methods”, in: “Computing methods in optimization problems, 2”, Eds. Zadeh, Neustadt and Balakrishnan (Academic Press, New York, 1969).

    Google Scholar 

  6. C. Hildreth, “A quadratic programming procedure”,Naval Research Logistics Quarterly 14 (1957) 79–85.

    Google Scholar 

  7. F.A. Lootsma, “Boundary properties of penalty functions for constrained minimization”, Thesis, Technological University, Eindhoven (1970).

    Google Scholar 

  8. T. Pietrzykowski, “An exact potential method for constrained maxima”,SIAM Journal of Numerical Analysis 6 (1969) 299–304.

    Google Scholar 

  9. M.J.D. Powell, “A method for nonlinear constraints in minimization problems”, in:Optimization, Ed. R. Fletcher (Academic Press, New York, 1969).

    Google Scholar 

  10. J.B. Rosen and S. Suzuki, “Construction of nonlinear programming test problems”,Communications ACM 8 (1965) 113.

    Google Scholar 

  11. H.H. Rosenbrock, “An automatic method for finding the greatest or least values of a function”,Computer Journal 3 (1960) 175–184.

    Google Scholar 

  12. W.I. Zangwill, “Nonlinear programming via penalty functions”,Management Science 13 (1967) 344–358.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.E.R.E., Harwell, Berkshire, Great Britain

    R. Fletcher

Authors
  1. R. Fletcher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fletcher, R. An exact penalty function for nonlinear programming with inequalities. Mathematical Programming 5, 129–150 (1973). https://doi.org/10.1007/BF01580117

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation