Skip to main content
Log in

Stable exponential-penalty algorithm with superlinear convergence

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

Abstract

A renewed interest in penalty algorithms for solving mathematical programming problems has been motivated by some recent techniques which eliminate the ill-conditioning caused by the convergence to zero of the penalty parameter. These techniques are based on a good identification of the active set of constrainst at the optimum. In this sense, interior penalty methods to be more efficient than exterior ones, but their drawback lies in the need of an interior starting point. We propose in this paper an exponential penalty function which does not need interior starting points, but whose ultimate behavior is just like an interior penalty method. A superlinearly convergent algorithm based on the exponential penalty function is proposed.

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. Broyden, C., andAttia, N.,A Smooth Sequential Penalty Function Method for Solving Nonlinear Programming Problems, System Modelling and Optimization, Edited by P. Thoft-Christensen, Springer Verlag, Berlin, Germany, pp. 237–245, 1983.

    Google Scholar 

  2. Broyden, C., andAttia, N.,Penalty Functions, Newton's Method, and Quadratic Programming, Journal of Optimization Theory and Applications, Vol. 58, pp. 377–385, 1988.

    Article  Google Scholar 

  3. Gould, N.,On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions, IMA Journal on Numerical Analysis., Vol. 6, pp. 3357–372, 1986.

    Google Scholar 

  4. Dussault, J. P.,Numerical Stability and Efficiency of Penalty Algorithms, SIAM Journal on Numerical Analysis (to appear).

  5. Frish, K.,The Logarithmic Potential Methods of Convex Programming, Memorandum, Univeristy Institute of Economics, Oslo, Norway, 1955.

    Google Scholar 

  6. Murray, W.,Constraned Optimization, PhD Thesis, University of London, London, England, 1969.

    Google Scholar 

  7. Moullif, K., andTossings, P.,Une Méthode de Pénalisation Exponentielle Associée à une Régularisation Proximale, Bulletin de la Société Royale des Sciences de Liège, Vol. 56, pp. 181–190, 1987.

    Google Scholar 

  8. Strodiot, J. J., andNguyen, V. H.,An Exponential Penalty Method for Nondifferentiable Minimax-Problems with General Constraints, Journal of Optimaziation Theory and Applications, Vol. 27, pp. 205–219, 1979.

    Article  Google Scholar 

  9. Gould, N.,On the Convergence of a Sequential Penalty Function Method for Constrained Minimization, SIAM Journal on Numerical Analysis, Vol. 26, pp. 107–108, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by C. G. Broyden

This research was partially supported by FONDECYT Grant 90-0945, DTI Grant E.3101-9012, and NSERC Grant OGP0005491.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cominetti, R., Dussault, J.P. Stable exponential-penalty algorithm with superlinear convergence. J Optim Theory Appl 83, 285–309 (1994). https://doi.org/10.1007/BF02190058

Download citation

  • Issue Date:

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

Key Words

Navigation