Skip to main content
Log in

An exponential penalty method for nondifferentiable minimax problems with general constraints

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

Abstract

A well-known approach to constrained minimization is via a sequence of unconstrained optimization computations applied to a penalty function. This paper shows how it is possible to generalize Murphy's penalty method for differentiable problems of mathematical programming (Ref. 1) to solve nondifferentiable problems of finding saddle points with constraints. As in mathematical programming, it is shown that the method has the advantages of both Fiacco and McCormick exterior and interior penalty methods (Ref. 2). Under mild assumptions, the method has the desirable property that all trial solutions become feasible after a finite number of iterations. The rate of convergence is also presented. It should be noted that the results presented here have been obtained without making any use of differentiability assumptions.

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. Murphy, F.,A Class of Exponential Penalty Functions, SIAM Journal on Control, Vol. 12, pp. 679–687, 1974.

    Google Scholar 

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

    Google Scholar 

  3. Dem'Yanov, V., andPevnyi, A.,Numerical Methods for Finding Saddle Points, USSR Computational Mathematics and Mathematical Physics, Vol. 12, pp. 11–52, 1972.

    Google Scholar 

  4. Sasai, H.,An Interior Penalty Method for Minimax Problems with Constraints, SIAM Journal on Control, Vol. 12, pp. 643–649, 1974.

    Google Scholar 

  5. Auslender, A.,Problèmes de Minimax via l'Analyse Convexe et les Inégalités Variationnelles: Théorie et Algorithmes, Springer-Verlag, Berlin, Germany, 1972.

    Google Scholar 

  6. Mangasarian, O.,Nonlinear Programming, McGraw Hill Book Company, New York, New York, 1969.

    Google Scholar 

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

    Google Scholar 

  8. Ekeland, I., andTemam, R.,Convex Analysis and Variational Problems, North-Holland Publishing Company, Amsterdam, Holland, 1975.

    Google Scholar 

  9. Levitin, E. S., andPolyak, B. T.,Constrained Minimization Methods, USSR Computational Mathematics and Mathematical Physics, Vol. 6, pp. 1–50, 1966.

    Google Scholar 

  10. Evans J., Gould, F., andTolle, J.,Exact Penalty Functions in Nonlinear Programming, Mathematical Programming, Vol. 4, pp. 72–97, 1973.

    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

Strodiot, J.J., Nguyen, V.H. An exponential penalty method for nondifferentiable minimax problems with general constraints. J Optim Theory Appl 27, 205–219 (1979). https://doi.org/10.1007/BF00933227

Download citation

  • Issue Date:

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

Key Words

Navigation