Ariyawansa [2] has introduced a line search termination criterion for collinear scaling minimization algorithms. However, he verified that this criterion provides sufficient decrease only in the case of objective functions that satisfy certain strong convexity assumptions. In this paper, we report results of our attempts to relax these assumptions. We present an example of a continuously differentiable, nonconvex function with bounded level sets on which the criterion of Ariyawansa [2] does not provide sufficient decrease. This example indicates that specifying line search termination criteria for collinear scaling algorithms is still an open problem. On a more positive note, we are able to show that the class of objective functions on which the criterion of Ariyawansa [2] provides sufficient decrease can be extended to include convex and strictly pseudo-convex functions.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 28, 2001; revised November 6, 2002 Published online: January 16, 2003
Rights and permissions
About this article
Cite this article
Ariyawansa, K., Tabor, W. A Note on Line Search Termination Criteria for Collinear Scaling Algorithms. Computing 70, 25–39 (2003). https://doi.org/10.1007/s00607-002-1466-9
Issue Date:
DOI: https://doi.org/10.1007/s00607-002-1466-9