Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

The affine scale invariance of minimization algorithms
HTML articles powered by AMS MathViewer

by J. N. Lyness PDF
Math. Comp. 33 (1979), 265-287 Request permission

Abstract:

Let $f(x)$ be a general objective function and let $\bar f(x) = h + mf(Ax + d)$. An analytic estimation of the minimum of one would resemble an analytic estimation of the other in all nontrivial respects. However, the use of a minimization algorithm on either might or might not lead to apparently unrelated sequences of calculations. This paper is devoted to providing a general theory for the affine scale invariance of algorithms. Key elements in this theory are groups of transformations T whose elements relate $\bar f(x)$ and $f(x)$ given above. The statement that a specified algorithm is scale invariant with respect to a specified group T is defined. The scale invariance properties of several well-known algorithms are discussed.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65K05, 90C30
  • Retrieve articles in all journals with MSC: 65K05, 90C30
Additional Information
  • © Copyright 1979 American Mathematical Society
  • Journal: Math. Comp. 33 (1979), 265-287
  • MSC: Primary 65K05; Secondary 90C30
  • DOI: https://doi.org/10.1090/S0025-5718-1979-0514823-9
  • MathSciNet review: 514823