The use of alternation and recurrences in two-step quasi-Newton methods

DOI10.1016/j.camwa.2005.08.006zbMath1086.65058OpenAlexW2047207775MaRDI QIDQ815228

I. A. Moghrabi, John A. Ford

Publication date: 16 February 2006

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

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.08.006

zbMATH Keywords

numerical experimentsrecurrencemultistep quasi-Newton methodsfixed-point methodunconstrained optimisation

Mathematics Subject Classification ID

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

Related Items (1)

Memory gradient method with Goldstein line search

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-step quasi-Newton methods for optimization
• Minimum curvature multistep quasi-Newton methods
• Alternating multi-step quasi-Newton methods for unconstrained optimization
• Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Least Change Secant Updates for Quasi-Newton Methods
• Testing Unconstrained Optimization Software
• Matrix conditioning and nonlinear optimization
• On Large Scale Nonlinear Least Squares Calculations
• 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
• Implicit updates in multistep quasi-Newton methods

This page was built for publication: The use of alternation and recurrences in two-step quasi-Newton methods