On algorithms invariant to nonlinear scaling with inexact searches (Q1101347)

Among the problems of unconstrained optimization invariancy to nonlinear scaling is an interesting subject. But the discussions were so far based on the assumption of exact line searches. Hence there are some essential deficiency in theory and practice. In this paper, using a more general concept of invariance, an invariant algorithm not depending on the accuracy of line searches is established for the model of \textit{W. R. Boland, E. R. Kamgnia} and \textit{J. S. Kowalik} [J. Optimization Theory Appl. 27, 221-230 (1979; Zbl 0396.49024)].