A New Scaled Secant-Type Conjugate Gradient Algorithm
- 1 November 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 96-100
Abstract
Motivated by the success of Shanno's memoryless Conjugate Gradient (CG) methods [28,29], this paper derives a new scaled quasi-Newton like CG algorithm that utilizes an update formula that is invariant to a scaling of the objective function. The computation of the search directions at each iteration is done in two steps. The computations involved are rather cheap as they merely involve a number of inner products and require extra O(n) storage requirements. The extra requirements are shown to pay off when the algorithm is numerically compared to that developed by Shanno.Keywords
This publication has 25 references indexed in Scilit:
- Numerical Experience with Multiple Update Quasi-Newton Methods for Unconstrained OptimizationJournal of Mathematical Modelling and Algorithms, 2006
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line SearchSIAM Journal on Optimization, 2005
- Using function-values in multi-step quasi-Newton methodsJournal of Computational and Applied Mathematics, 1996
- Multi-step quasi-Newton methods for optimizationJournal of Computational and Applied Mathematics, 1994
- Alternative parameter choices for multi-step Quasi-Newton methodsOptimization Methods and Software, 1993
- Conjugate Gradient Methods with Inexact SearchesMathematics of Operations Research, 1978
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- Function minimization by conjugate gradientsThe Computer Journal, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952