Preconditioned low-order Newton methods

DOI10.1007/BF00940583zbMath0797.90094OpenAlexW2081857118MaRDI QIDQ1321417

V. Pereyra

Publication date: 27 April 1994

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

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

zbMATH Keywords

unconstrained optimizationpreconditioningNewton methodBroyden family of quasi-Newton methodslow-order Newton methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

A generalized conjugate gradient algorithm

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient generalized conjugate gradient algorithms. II: Implementation
• Conjugate Gradient Methods less Dependent on Conjugacy
• The method of successive affine reduction for nonlinear minimization
• Testing Unconstrained Optimization Software
• Matrix conditioning and nonlinear optimization

This page was built for publication: Preconditioned low-order Newton methods