Skip to main content
SpringerLink
Log in

Can Newton method be surpassed

  • Notes
  • Published:
Chinese Science Bulletin

Abstract

A local algorithm is proposed for unconstrained optimization problem. Compared with the traditional Newton method with Choleski factorization, this algorithm has the same quadratic convergence. But its computation cost per iteration in average is less when the dimensionn≥55. The saving is estimated in the theoretical framework.

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. Ortega, J. M., Rheinboldt, W. C.,Iterative Solution of Nonlinear Equations in Several Variables, London: Academic Press, 1970, 299–346.

    Google Scholar 

  2. Kelley, C. T.,Iterative Methods for Linear and Nonlinear Equations, Phi1adelphia: SIAM. 1995, 11–29.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. China Agricultural University, 100083, Beijing, China

    Naiyang Deng & Zhaozhi Wang

Authors
  1. Naiyang Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhaozhi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Deng, N., Wang, Z. Can Newton method be surpassed. Chin. Sci. Bull. 44, 132–134 (1999). https://doi.org/10.1007/BF02884735

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation