Metric-Based Parameterizations for Multi-Step Unconstrained Optimization

ABSTRACT

We consider multi-step quasi-Newton methods for unconstrained optimization. These methods were introduced by Ford and Moghrabi (Appl. Math., vol. 50, pp. 305–323, 1994; Optimization Methods and Software, vol. 2, pp. 357–370, 1993), who showed how interpolating curves could be used to derive a generalization of the Secant Equation (the relation normally employed in the construction of quasi-Newton methods). One of the most successful of these multi-step methods makes use of the current approximation to the Hessian to determine the parameterization of the interpolating curve in the variable-space and, hence, the generalized updating formula. In this paper, we investigate new parameterization techniques to the approximate Hessian, in an attempt to determine a better Hessian approximation at each iteration and, thus, improve the numerical performance of such algorithms.

REFERENCES

• 1: 1. G.G. Broyden, "The convergence of a class of double-rank minimization algorithms--Part 2: The new algorithm," J. Inst. Math. Applic., vol. 6, pp. 222-231, 1970.
• 2: 2. R. Fletcher, "A new approach to variable metric algorithms," Comput. J., vol. 13, pp. 317-322, 1970.
• 3: 3. J.A. Ford, "Implicit updates in multi-step quasi-Newton methods," in press.
• 4: 4. J.A. Ford and I.A. Moghrabi, "Alternative parameter choices for multi-step quasi-Newton methods," Optimization Methods and Software, vol. 2, pp. 357-370, 1993.
• 5: J. A. Ford , I. A. Moghrabi, Multi-step quasi-Newton methods for optimization, Journal of Computational and Applied Mathematics, v.50 n.1-3, p.305-323, May 20, 1994
• 6: J. A. Ford , I. A. Moghrabi, Alternating multi-step quasi-Newton methods for unconstrained optimization, Journal of Computational and Applied Mathematics, v.82 n.1-2, p.105-116, Sept. 15, 1997
• 7: 7. D. Goldfarb, "A family of variable metric methods derived by variational means," Math. Comp., vol. 24, pp. 23-26, 1970.
• 8: Jorge J. Moré , Burton S. Garbow , Kenneth E. Hillstrom, Testing Unconstrained Optimization Software, ACM Transactions on Mathematical Software (TOMS), v.7 n.1, p.17-41, March 1981 [doi>10.1145/355934.355936]
• 9: 9. D.F. Shanno, "Conditioning of quasi-Newton methods for function minimization," Math. Comp., vol. 24, pp. 647-656, 1970.

INDEX TERMS

Keywords:
multi-step methods, quasi-Newton methods, unconstrained optimization