Skip to main content
Log in

A generalized projection quasi‐Newton method for nonlinear optimization problems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, a generalized projection quasi‐Newton method with inexact line search is proposed for the nonlinear optimization problem with linear constraints. The projection andquasi‐Newton technique are used to determine the search direction at each iteration. It is proved that the method has properties of global convergence and superlinear convergence rate under some suitable 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.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Goldfarb, Extension of Davidon's variable metric method to maximization under linear inequality and equality constraints, SIAM. J. Appl. Math. 17(1969)739-364.

    Article  Google Scholar 

  2. D.Z. Du and J. Sun, A new gradient projection method, Math. Numer. Sinica 6(1984)378-376.

    Google Scholar 

  3. F. Wu, A superlinear convergent gradient projection type algorithm for linearly constrained problem, Eur. J. of Oper. Res. 16(1984) 334-334.

    Article  Google Scholar 

  4. X. Gui and D. Du, A superlinear convergent method to linearly constrained optimization under degeneracy, Acta. Math. Appl. Sinica 1(1984)76-84.

    Article  Google Scholar 

  5. Y.L. Lai, F. Wu and H.Y. Kwi, Reduced variable metric method for linearly constrained convex programming, Science in China (series A) 26(1983)785-794.

    Google Scholar 

  6. Z.Y. Gao and G.P. He, A generalized gradient projection algorithm for constrained optimization problem, Chinese Science Bulletin 36(1991)1444-1447.

    Google Scholar 

  7. Y.L. Lai, Z.Y. Gao and G.P. He, A generalized gradient projection algorithm of optimization with nonlinear constraints, Science in China (series A) 36((1993)170-180.

    Google Scholar 

  8. }Z.Y. Gao, Feasible methods for nonlinear programming with nonlinear constraints and their convergent properties, Ph.D. Thesis, Institute of Applied Mathematics, Academia Sinica, Beijing, China, 1993.

    Google Scholar 

  9. G.P. He, Some new superlinearly convergent algorithms for nonlinear programming problems, Ph.D. Thesis, Institute of Applied Mathematics, Academia Sinica, Beijing, China, 1995.

    Google Scholar 

  10. R. Fletcher, Practical Methods of Optimization, Vol. 2, 1981.

  11. M.J.D. Powell, Some global convergence properties of a variable metric algorithm for minimization without exact linear searches, SIAM-AMS Proceedings 9, 1976.

  12. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 187, Springer, Berlin, 1981.

    Google Scholar 

  13. P. Wolfe, Methods of nonlinear programming, in: Nonlinear Programming, ed. J. Abadie, Wiley Interscience, New York, 1967, pp. 97-131.

    Google Scholar 

  14. K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 282, Springer, Berlin, 1987.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lai, Y., Gao, Z. & He, G. A generalized projection quasi‐Newton method for nonlinear optimization problems. Annals of Operations Research 87, 353–362 (1999). https://doi.org/10.1023/A:1018949406680

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018949406680

Keywords

Navigation