Skip to main content
SpringerLink
Log in

A second-order method for the general nonlinear programming problem

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

Abstract

This paper presents a multiplier-type method for nonlinear programming problems with both equality and inequality constraints. Slack variables are used for the inequalities. The penalty coefficient is adjusted automatically, and the method converges quadratically to points satisfying second-order conditions.

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. Hestenes, M. R.,The Weierstrass E-Function in the Calculus of Variations, Transactions of the American Mathematical Society, Vol. 60, pp. 51–71, 1946.

    Google Scholar 

  2. Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, pp. 303–320, 1969.

    Google Scholar 

  3. Powell, M. J. D.,A Method for Nonlinear Constraints in Minimization Problems, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, pp. 283–298, 1969.

    Google Scholar 

  4. Haarhoff, P. C., andBuys, J. D.,A New Method for the Optimization of a Nonlinear Function Subject to Nonlinear Constraints, Computer Journal, Vol. 13, pp. 178–184, 1970.

    Google Scholar 

  5. Buys, J. D.,Dual Algorithms for Constrained Optimization, University of Leiden, The Netherlands, PhD Thesis, 1972.

    Google Scholar 

  6. Polyak, V. T., andTret'yakov, N. V.,The Method of Penalty Estimates for Conditional Extremum Problems, USSR Computational Mathematics and Mathematical Physics, Vol. 13, pp. 42–58, 1974.

    Google Scholar 

  7. Miele, A., Moseley, P. E., Levy, A. V., andCoggins, G. M.,On the Method of Multipliers for Mathematical Programming Problems, Journal of Optimization Theory and Applications, Vol. 10, pp. 1–33, 1972.

    Google Scholar 

  8. Miele, A., Moseley, P. E., andCragg, E. E.,A Modification of the Method of Multipliers for Mathematical Programming Problems, Techniques of Optimization, Edited by A. V. Balakrishnan, Academic Press, New York, New York, 1972.

    Google Scholar 

  9. Miele, A., Cragg, E. E., Iyer, R. R., andLevy, A. V.,Use of the Augmented Penalty Function in Mathematical Programming Problems, Part 1, Journal of Optimization Theory and Applications, Vol. 8, p. 115–130, 1971.

    Google Scholar 

  10. Miele, A., Cragg, E. E., andLevy, A. V.,Use of the Augmented Penalty Function in Mathematical Programming Problems, Part 2, Journal of Optimization Theory and Applications, Vol. 8, pp. 131–153, 1971.

    Google Scholar 

  11. Tripathi, S. S., andNarendra, K. S.,Considered Optimization Problems Using Multiplier Methods, Journal of Optimization Theory and Applications, Vol. 9, pp. 52–70, 1972.

    Google Scholar 

  12. Rupp, R. D.,On the Combination of the Multiplier Method of Hestenes and Powell with Newton's Method, Journal of Optimization Theory and Applications, Vol. 15, pp. 167–187, 1975.

    Google Scholar 

  13. Bertsekas, D. P.,On Penalty and Multiplier Methods, SIAM Journal on Control and Optimization, Vol. 14, pp. 216–235, 1976.

    Google Scholar 

  14. Bertsekas, D. P.,On the Method of Multipliers for Convex Programming, IEEE Transactions on Automatic Control, Vol. AC-20, pp. 385–388, 1975.

    Google Scholar 

  15. Bertsekas, D. P.,Convergence Rate of Penalty and Multiplier Methods, Proceedings of the 1973 IEEE Conference on Decision and Control, San Diego, California, pp. 260–264, 1973.

  16. Fletcher, R. A.,A Class of Methods for Nonlinear Programming with Termination and Convergence Properties, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, 1970.

    Google Scholar 

  17. Fletcher, R.,A Class of Methods for Nonlinear Programming, III: Rate of Convergence, Numerical Methods for Nonlinear Optimization, Edited by F. A. Lootsma, Academic Press, New York, New York, 1973.

    Google Scholar 

  18. Fletcher, R., andLill, S. A.,A Class of Methods for Nonlinear Programming, II: Computational Experience, Nonlinear Programming, Edited by J. B. Rosen, O. L. Mangasarian, and K. Ritter, Academic Press, New York, New York, 1971.

    Google Scholar 

  19. Martensson, K.,A New Approach to Constrained Function Optimization, Journal of Optimization Theory and Applications, Vol. 12, pp. 531–554, 1973.

    Google Scholar 

  20. Mukai, H., andPolak, E.,A Quadratically Convergent Primal-Dual Algorithm with Global Convergence Properties for Solving Optimization Problems with Equality Constraints, Mathematical Programming, Vol. 9, pp. 336–350, 1975.

    Google Scholar 

  21. Rockafellar, R. T.,A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization, Mathematical Programming, Vol. 5, pp. 354–373, 1973.

    Google Scholar 

  22. Rockafellar, R. T.,The Multiplier Method of Hestenes and Powell Applied to Convex Programming, Journal of Optimization Theory and Applications, Vol. 12, pp. 555–562, 1973.

    Google Scholar 

  23. Rockafellar, R. T.,Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming, SIAM Journal on Control, Vol. 12, pp. 268–285, 1974.

    Google Scholar 

  24. Arrow, K. J., Gould, F. J., andHowe, S. M.,A General Saddle Point Result for Constrained Optimization, Mathematical Programming, Vol. 5, pp. 225–234, 1973.

    Google Scholar 

  25. Mangasarian, O. L.,Unconstrained Lagrangians in Nonlinear Programming, SIAM Journal on Control, Vol. 13, pp. 772–791, 1975.

    Google Scholar 

  26. Wierzbicki, A. P.,A Penalty Function Shifting Method in Constrained Static Optimization and Its Convergence Properties, Archiwum Automatyki i Telemechaniki, Vol. 16, pp. 395–416, 1971.

    Google Scholar 

  27. Fletcher, R.,An Exact Penalty Function for Nonlinear Programming with Inequalities, Mathematical Programming, Vol. 5, pp. 129–150, 1973.

    Google Scholar 

  28. Lill, S. A.,Generalization of an Exact Method for Solving Equality Constrained Problems to Deal with Inequality Constraints, Numerical Methods for Nonlinear Optimization, Edited by F. A. Lootsma, Academic Press, New York, New York, 1972.

    Google Scholar 

  29. Polak, E.,On the Global Stabilization of Locally Convergent Algorithms for Optimization and Root Finding, Automatica, Vol. 12, pp. 337–342, 1976.

    Google Scholar 

  30. Mukai, H., andPolak, E.,A Second-Order Method for Unconstrained Optimization, Journal of Optimization Theory and Applications, Vol. 26, pp. 501–513, 1978.

    Google Scholar 

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

    Google Scholar 

  32. Wilson, R. B.,A Simplicial Algorithm for Concave Programming, Harvard University, Cambridge, Massachusetts, Graduate School of Business Administration, PhD Dissertation, 1963.

    Google Scholar 

  33. Robinson, S. M.,A Quadratically-Convergent Algorithm for General Nonlinear Programming Problems, Mathematical Programming, Vol. 3, pp. 145–156, 1972.

    Google Scholar 

  34. 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 

  35. McCormick, G. P.,An Arc Method for Nonlinear Programming, SIAM Journal on Control, Vol. 13, pp. 1194–1216, 1975.

    Google Scholar 

  36. Luenberger, D. G.,Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1973.

    Google Scholar 

  37. Tapia, R.,A Stable Approach to Newton's Method for General Mathematical Programming Problems in R n, Journal of Optimization Theory and Applications, Vol. 14, pp. 453–476, 1974.

    Google Scholar 

  38. Tapia, R.,Newton's Method for Optimization Problems with Equality Constraints, SIAM Journal of Numerical Analysis, Vol. 11, pp. 874–886, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems Science and Mathematics, Washington University, St. Louis, Missouri

    H. Mukai (Assistant Professor)

  2. Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California, Berkeley, Califorinia

    E. Polak (Professor)

Authors
  1. H. Mukai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Polak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by D. Q. Mayne

The work of the first author was supported by NSF RANN and JSEP Contract No. F44620-71-C-0087; the work of the second author was supported by the National Science Foundation Grant No. ENG73-08214A01 and US Army Research Office Durham Contract No. DAHC04-73-C-0025.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mukai, H., Polak, E. A second-order method for the general nonlinear programming problem. J Optim Theory Appl 26, 515–532 (1978). https://doi.org/10.1007/BF00933150

Download citation

  • Issue Date:

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

Key Words

Search

Navigation