Can Newton method be surpassed.

DOI10.1007/BF02884735zbMATH Open1142.90487OpenAlexW2019398280MaRDI QIDQ701596FDOQ701596

Nai-Yang Deng, Zhaozhi Wang

Publication date: 6 November 2002

Published in: Chinese Science Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02884735

zbMATH Keywords

Cholesky factorizationNewton methodpreconditioned conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Theoretical efficiency of an inexact Newton method

   Recommendations

• Theoretical efficiency of an inexact Newton method 👍 👎
• Title not available (Why is that?) 👍 👎
• An algorithm for unconstrained optimization 👍 👎
• An improved inexact Newton method 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Can Newton method be surpassed.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701596)