Skip to main content
Log in

Globally Convergent Inexact Generalized Newton Method for First-Order Differentiable Optimization Problems

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

Abstract

Motivated by the method of Martinez and Qi (Ref. 1), we propose in this paper a globally convergent inexact generalized Newton method to solve unconstrained optimization problems in which the objective functions have Lipschitz continuous gradient functions, but are not twice differentiable. This method is implementable, globally convergent, and produces monotonically decreasing function values. We prove that the method has locally superlinear convergence or even quadratic convergence rate under some mild conditions, which do not assume the convexity of the functions.

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. MARTINEZ, J. M., and QI, L., Inexact Newton's Method for Solving Nonsmooth Equations, Journal of Computer Applied Mathematics, Vol. 60, pp. 127-145, 1995.

    Google Scholar 

  2. DEMBO, R. S., EISENSTAT, S. C., and STEIHAUG, T., Inexact Newton's Method, SIAM Journal on Numerical Analysis, Vol. 14, pp. 400-408, 1982.

    Google Scholar 

  3. DEMBO, R. S., and STEIHAUG, R., Truncated-Newton's Method for Large-Scale Unconstrained Optimization, Mathematical Programming, Vol. 26, pp. 190-212, 1982.

    Google Scholar 

  4. EISENSTAT, S. C., and WALKER, H. F., Globally Convergent Inexact Newton's Method, SIAM Journal on Optimization, Vol. 4, pp. 393-422, 1994.

    Google Scholar 

  5. CLARKE, F. H., Optimization and Nonsmooth Analysis, SIAM, Philadelphia, Pennsylvania, 1990.

    Google Scholar 

  6. QI, L., and SUN, J., A Nonsmooth Version of Newton's Method, Mathematical Programming, Vol. 58, pp. 353-368, 1993.

    Google Scholar 

  7. QI, L., Convergence Analysis of Some Method for Solving Nonsmooth Equations, Mathematics of Operations Research, Vol. 18, pp. 227-243, 1993.

    Google Scholar 

  8. PANG, J. S., and QI, L., A Globally Convergent Newton's Method for Convex SC 1 Minimization Problems, Journal of Optimization Theory and Applications, Vol. 85, pp. 633-648, 1995.

    Google Scholar 

  9. FACCHINEI, F., FISCHER, A., and KANZOW, C., Inexact Newton's Method for Semismooth Equations with Applications to Variational Inequality Problems, Nonlinear Optimization and Applications, Edited by G. Di Pillo and F. Giannessi, Plenum Press, New York, NY, pp. 125-139, 1996.

    Google Scholar 

  10. FACCHINEI, F., and KANZOW, C., A Nonsmooth Inexact Newton Method for the Solution of Large Nonlinear Complementarity Problems, Mathematical Programming, Vol. 76, pp. 493-512, 1997.

    Google Scholar 

  11. FISCHER, A., Solution of Monotone Complementarity Problems with Locally Lipschitzian Functions, Mathematical Programming, Vol. 76, pp. 513-532, 1997.

    Google Scholar 

  12. PU, D., and ZHANG, J., Globally Convergent Inexact Generalized Newton's Method for Non-Twice Differentiable Optimization Problems, Research Report MA-97-08, City University of Hong Kong, 1997.

  13. PU, D., and ZHANG, J., An Inexact Generalized Newton's Method for Second Order C-Differentiable Optimization, Journal of Computational and Applied Mathematics, Vol. 93, pp. 107-122, 1998.

    Google Scholar 

  14. QI, L., C-Differential Operators, C-Differentiability, and Generalized Newton Method, Applied Mathematics Report AMR96/5, University of New South Wales, Sydney, Australia, 1996.

    Google Scholar 

  15. PANG, J. S., and QI, L., Nonsmooth Equations: Motivation and Method, SIAM Journal on Optimization, Vol. 3, pp. 443-465, 1993.

    Google Scholar 

  16. DENNIS, J. E., Jr., and MORÄ, J. J., Quasi-Newton's Method: Motivation and Theory, SIAM Review, Vol. 19, pp. 46-89, 1977.

    Google Scholar 

  17. FLETCHER, R., Practical Method of Optimization, Vol. 1: Unconstrained Optimization, John Wiley and Sons, New York, NY, 1987.

    Google Scholar 

  18. ZOUTENDIJK, G., Nonlinear Programming: Computational Method, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland, Amsterdam, Holland, pp. 37-86, 1970.

    Google Scholar 

  19. WOLFE, P., Convergence Conditions for the Ascent Method, SIAM Review, Vol. 11, pp. 226-235, 1969.

    Google Scholar 

  20. WOLFE, P., Convergence Conditions for the Ascent Method, II: Some Corrections, SIAM Review, Vol. 13, pp. 185-188, 1971.

    Google Scholar 

  21. Di Pillo, G., Exact Penalty Method, Algorithms for Continuous Optimization: The State of the Art, Edited by E. Spedicato, Kluwer Press, Boston, Massachusetts, 1994.

    Google Scholar 

  22. Di Pillo, G., and LUCIDI, S., On Exact Augmented Lagrangian Functions in Nonlinear Programming Problems, Nonlinear Optimization and Applications, Edited by G. Di Pillo and F. Giannessi, Plenum Press, New York, NY, pp. 85-103, 1996.

    Google Scholar 

  23. Di Pillo, G., and GRIPPO, L., A New Class of Lagrangians in Nonlinear Optimization, SIAM Journal on Control and Optimization, Vol. 17, pp. 616-628, 1979.

    Google Scholar 

  24. Di Pillo, G., and GRIPPO, L., An Augmented Lagrangian for Inequality Constraints in Nonlinear Programming Problems, Journal of Optimization Theory and Applications, Vol. 36, pp. 495-519, 1982.

    Google Scholar 

  25. PU, D., A Class of Augmented Lagrange Multiplier Functions, Journal of the Shanghai Institute of Rail Technology, Vol. 2, pp. 45-56, 1984.

    Google Scholar 

  26. SCHITTKOWSKI, K., More Test Examples for Nonlinear Programming Codes, Springer Verlag, Berlin, Germany, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pu, D., Zhang, J. Globally Convergent Inexact Generalized Newton Method for First-Order Differentiable Optimization Problems. Journal of Optimization Theory and Applications 106, 551–568 (2000). https://doi.org/10.1023/A:1004605428858

Download citation

  • Issue Date:

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

Navigation