Implicit updates in multistep quasi-Newton methods

DOI10.1016/S0898-1221(01)00223-1zbMath0989.65063OpenAlexW2082573659MaRDI QIDQ5948884

John A. Ford

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00223-1

zbMATH Keywords

unconstrained optimizationnumerical testsapproximate Hessianimplicit updatesmultistep quasi-Newton methods

Mathematics Subject Classification ID

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

Related Items (6)

New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ Global convergence property of scaled two-step BFGS method ⋮ Memory gradient method with Goldstein line search ⋮ The use of alternation and recurrences in two-step quasi-Newton methods ⋮ Three-step fixed-point quasi-Newton methods for unconstrained optimisation

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-step quasi-Newton methods for optimization
• Alternating multi-step quasi-Newton methods for unconstrained optimization
• Testing Unconstrained Optimization Software
• Matrix conditioning and nonlinear optimization
• A Family of Variable-Metric Methods Derived by Variational Means
• The Convergence of a Class of Double-rank Minimization Algorithms
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization

This page was built for publication: Implicit updates in multistep quasi-Newton methods