Minimum curvature multistep quasi-Newton methods

DOI10.1016/0898-1221(95)00230-8MaRDI QIDQ1361291zbMATH OpenOpenAlexFDO

Authors I. A. Moghrabi, J. 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) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 4091191 (Why is no real title available?)
• scientific article; zbMATH DE number 1552870 (Why is no real title available?)
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• Least Change Secant Updates for Quasi-Newton Methods
• Multi-step quasi-Newton methods for optimization
• The Convergence of a Class of Double-rank Minimization Algorithms

Cited in

(13)

• A new class of memory gradient methods with inexact line searches
• scientific article; zbMATH DE number 1501877 (Why is no real title available?)
• scientific article; zbMATH DE number 2110706 (Why is no real title available?)
• scientific article; zbMATH DE number 1396590 (Why is no real title available?)
• A curvilinear method based on minimal-memory BFGS updates
• Memory gradient method with Goldstein line search
• Fast numerical schemes related to curvature minimization: a brief and elementary review
• A new super-memory gradient method with curve search rule
• A new descent algorithm with curve search rule
• Alternating multi-step quasi-Newton methods for unconstrained optimization
• New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation
• Three-step fixed-point quasi-Newton methods for unconstrained optimisation
• The use of alternation and recurrences in two-step quasi-Newton methods

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Minimum curvature multistep quasi-Newton methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361291)