Theoretical efficiency of an inexact Newton method

DOI10.1023/A:1004614012113zbMath0971.90110OpenAlexW165367249MaRDI QIDQ1579635

Zhaozhi Wang, Nai-Yang Deng

Publication date: 11 January 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004614012113

zbMATH Keywords

unconstrained optimizationCholesky factorizationNewton methodpreconditioned conjugate gradient iteration

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Methods of reduced gradient type (90C52)

Related Items (7)

A nonmonotone inexact Newton method for unconstrained optimization ⋮ Theoretical efficiency of a new inexact method of tangent hyperbolas ⋮ On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms ⋮ An improved inexact Newton's method for unary optimization ⋮ Theoretical efficiency of a new inexact method of tangent hyperbolas ⋮ An inexact Newton method derived from efficiency analysis ⋮ PCG-inexact Newton methods for unary optimization

Uses Software

• LANCELOT
• KELLEY
• tn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can Newton method be surpassed.
• Numerical experience with the truncated Newton method for unconstrained optimization
• Nonmonotonic trust region algorithm
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Preconditioning of Truncated-Newton Methods
• Inexact Newton Methods
• Choosing the Forcing Terms in an Inexact Newton Method
• Iterative Solution Methods
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations

This page was built for publication: Theoretical efficiency of an inexact Newton method