Skip to main content
SpringerLink
Log in

A globally convergent method for nonlinear programming

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

Abstract

Recently developed Newton and quasi-Newton methods for nonlinear programming possess only local convergence properties. Adopting the concept of the damped Newton method in unconstrained optimization, we propose a stepsize procedure to maintain the monotone decrease of an exact penalty function. In so doing, the convergence of the method is globalized.

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

Access this article

Log in via an institution

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. Robinson, S. M.,Perturbed Kuhn-Tucker Points and Rates of Convergence for a Class of Nonlinear-Programming Algorithms, Mathematical Programming, Vol. 7, pp. 1–16, 1974.

    Google Scholar 

  2. Garcia-Palomares, U. M., andMangasarian, O. L.,Superlinearly Convergent Quasi-Newton Algorithms for Nonlinearly Constrained Optimization Problems, Mathematical Programming, Vol. 11, pp. 1–13, 1976.

    Google Scholar 

  3. Han, S. P.,Superlinearly Convergent Variable Metric Algorithms for General Nonlinear Programming Problems, Mathematical Programming, Vol. 11, pp. 263–282, 1976.

    Google Scholar 

  4. Kowalik, J., andOsborne, M. R.,Methods for Unconstrained Optimization Problems, American Elsevier, New York, New York, 1968.

    Google Scholar 

  5. Dem'yanov, V. F., andMalozemov, V. N.,Introduction to Minimax, John Wiley and Sons, New York, New York, 1974.

    Google Scholar 

  6. Daniel, J. M.,Stability of the Solution of Definite Quadratic Programs, Mathematical Programming, Vol. 5, pp. 41–53, 1973.

    Google Scholar 

  7. Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.

    Google Scholar 

  8. Stoer, J., andWitzgall, C.,Convexity and Optimization in Finite Dimensions, I, Springer-Verlag, Berlin, Germany, 1970.

    Google Scholar 

  9. Han, S. P.,Dual Variable Metric Methods for Constrained Optimization Problems, SIAM Journal on Control and Optimization, Vol. 15, No. 4, 1977.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, New York

    S. P. Han (Assistant Professor)

Authors
  1. S. P. Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by M. R. Hestenes

This research was supported in part by the National Science Foundation under Grant No. ENG-75-10486.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Han, S.P. A globally convergent method for nonlinear programming. J Optim Theory Appl 22, 297–309 (1977). https://doi.org/10.1007/BF00932858

Download citation

  • Issue Date:

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

Key Words

Search

Navigation