Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A bench mark experiment for minimization algorithms


Author: J. N. Lyness
Journal: Math. Comp. 33 (1979), 249-264
MSC: Primary 65K05; Secondary 90C30
MathSciNet review: 514822
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we suggest a single bench mark problem family for use in evaluating unconstrained minimization algorithms or routines. In essence, this problem consists of measuring, for each algorithm, the rate at which it descends an unlimited helical valley. The periodic nature of the problem allows us to exploit affine scale invariance properties of the algorithm. As a result, the capacity of the algorithm to minimize a wide range of helical valleys of various scales may be summarized by calculating a single valued function $ {g_Q}({X_1})$. The measurement of this function is not difficult, and the result provides information of a simple, general character for use in decisions about choice of algorithm.


References [Enhancements On Off] (What's this?)

  • [W] William C. Davidon, Optimally conditioned optimization algorithms without line searches, Math. Programming 9 (1975), no. 1, 1–30. MR 0383741 (52 #4621)
  • [W] C. DAVIDON & L. NAZARETH (1977), DRVOCR-A Fortran Implementation of Davidon's Optimally Conditioned Method, ANL-AMD Technical Memorandum No. 306.
  • [R] FLETCHER (1972), "Conjugate direction methods," Numerical Methods for Unconstrained Optimization, (W. Murray, Editor), Academic Press, London, pp. 73-86.
  • [P] E. GILL, W. MURRAY, S. M. PICKEN, S. R. GRAHAM & M. H. WRIGHT (1975), Subroutine QNMDER, A Quasi-Newton Algorithm to Find the Unconstrained Minimum of a Function of N Variables When First Derivatives are Available, Technical Memorandum E4/02/0/Fortran/11/75, National Physical Laboratory, Teddington, Middlesex TW11 OLW, England.
  • [J] J. N. Lyness, The affine scale invariance of minimization algorithms, Math. Comp. 33 (1979), no. 145, 265–287. MR 514823 (80m:65050b), http://dx.doi.org/10.1090/S0025-5718-1979-0514823-9
  • [J] N. LYNESS & C. GREENWELL (1977), A Pilot Scheme for Minimization Software Evaluation, ANL-AMD Technical Memorandum No. 323.
  • [M] M. J. D. Powell, Some global convergence properties of a variable metric algorithm for minimization without exact line searches, Nonlinear programming (Proc. Sympos., New York, 1975) Amer. Math. Soc., Providence, R. I., 1976, pp. 53–72. SIAM-AMS Proc., Vol. IX. MR 0426428 (54 #14371)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65K05, 90C30

Retrieve articles in all journals with MSC: 65K05, 90C30


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1979-0514822-7
PII: S 0025-5718(1979)0514822-7
Keywords: Numerical software evaluation, affine scale invariance, minimization algorithms, optimization algorithms
Article copyright: © Copyright 1979 American Mathematical Society