Numerical experiments on DFP-method, a powerful function minimization technique

DOI10.1016/0771-050X(75)90017-0zbMath0315.65037MaRDI QIDQ1221477

Asghar Husain, Hans-Juergen Zimmermann, P. J. Reddy

Publication date: 1975

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unified approach to quadratically convergent algorithms for function minimization
• Numerical experiments on quadratically convergent algorithms for function minimization
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• Computational experience with quadratically convergent minimisation methods
• Variable metric methods of minimisation
• On-line state estimation with a small computer
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
• Parameter Selection for Modified Newton Methods for Function Minimization
• A Formulation of Variable Metric Methods
• Methods of conjugate gradients for solving linear systems