Three-step fixed-point quasi-Newton methods for unconstrained optimisation

DOI10.1016/j.camwa.2005.08.007zbMath1086.65059OpenAlexW2077039189MaRDI QIDQ815230

S. Tharmlikit, 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.007

zbMATH Keywords

numerical examplesmultistep quasi-Newton methodsunconstrained optimisation

Mathematics Subject Classification ID

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

Related Items (2)

Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation ⋮ 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
• New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation
• Least Change Secant Updates for Quasi-Newton Methods
• 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
• Implicit updates in multistep quasi-Newton methods

This page was built for publication: Three-step fixed-point quasi-Newton methods for unconstrained optimisation