Minimum curvature multistep quasi-Newton methods

DOI10.1016/0898-1221(95)00230-8zbMath0874.65046OpenAlexW1993913013MaRDI QIDQ1361291

I. A. Moghrabi, John A. Ford

Publication date: 13 November 1997

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

Full work available at URL: https://doi.org/10.1016/0898-1221(95)00230-8

zbMATH Keywords

performancealgorithmunconstrained optimizationinterpolating polynomialsmultistep quasi-Newton methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)

Related Items (8)

New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation ⋮ Alternating multi-step quasi-Newton methods for unconstrained optimization ⋮ Memory gradient method with Goldstein line search ⋮ A new descent algorithm with curve search rule ⋮ A new class of memory gradient methods with inexact line searches ⋮ A new super-memory gradient method with curve search rule ⋮ The use of alternation and recurrences in two-step quasi-Newton methods ⋮ Three-step fixed-point quasi-Newton methods for unconstrained optimisation

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-step quasi-Newton methods for optimization
• Least Change Secant Updates for Quasi-Newton Methods
• 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: Minimum curvature multistep quasi-Newton methods