Skip to main content
Log in

Penalty function theory for general convex programming problems

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

Abstract

A class of penalty functions for solving convex programming problems with general constraint sets is considered. Convergence theorems for penalty methods are established by utilizing the concept of infimal convergence of a sequence of functions. It is shown that most existing penalty functions are included in our class of penalty functions.

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. Lootsman, 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.

    Google Scholar 

  3. Fiacco, A. V.,A General Regularized Sequential Unconstrained Minimization Technique, SIAM Journal on Applied Mathematics, Vol. 17, pp. 1239–1245, 1969.

    Google Scholar 

  4. Fiacco, A. V.,Penalty Methods for Mathematical Programming in E n with General Constraint Sets, Journal of Optimization Theory and Applications, Vol. 6, pp. 252–268, 1970.

    Google Scholar 

  5. Fiacco, A. V., andJones, A. P.,Generalized Penalty Methods in Topological Spaces, SIAM Journal on Applied Mathematics, Vol. 17, pp. 996–1000, 1969.

    Google Scholar 

  6. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  7. Abrams, R. A., andBen-Israel, A.,Optimality Conditions and Recession Cones, Operations Research, Vol. 23, pp. 549–553, 1975.

    Google Scholar 

  8. Wijsman, R. A.,Convergence of Sequences of Convex Sets, Cones, and Functions, I, Bulletin of the American Mathematical Society, Vol. 70, pp. 186–188, 1964.

    Google Scholar 

  9. Wijsman, R. A.,Convergence of Sequences of Convex Sets, Cones, and Functions, II, Transactions of the American Mathematical Society, Vol. 123, pp. 32–45, 1966.

    Google Scholar 

  10. Berge, C.,Topological Spaces, Oliver and Boyd, London, England, 1963.

    Google Scholar 

  11. Allran, R. R., andJohnsen, S. E. J.,An Algorithm for Solving Nonlinear Programming Problems Subject to Nonlinear Inequality Constraints, Computer Journal, Vol. 13, pp. 171–177, 1970.

    Google Scholar 

  12. Evans, J. P., andGould, F. J.,Stability and Exponential Penalty Function Techniques in Nonlinear Programming, University of North Carolina, Chapel Hill, North Carolina, Institute of Statistics, Mimeo Series No. 723, 1970.

    Google Scholar 

  13. Murphy, F. M.,A Class of Exponential Penalty Functions, SIAM Journal on Control, Vol. 12, pp. 679–687, 1974.

    Google Scholar 

  14. Evans, J. P., andGould, F. J.,An Existence Theorem for Penalty Function Theory, SIAM Journal on Control, Vol. 12, pp. 509–516, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by A. V. Fiacco

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mine, H., Fukushima, M. Penalty function theory for general convex programming problems. J Optim Theory Appl 24, 287–301 (1978). https://doi.org/10.1007/BF00933282

Download citation

  • Issue Date:

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

Key Words

Navigation