Journal:Informatica
Volume 2, Issue 2 (1991), pp. 171–194
Abstract
The paper deals with the minimization algorithms which enable us to economize the computing time during the coordinated calculation of the values of an objective function on the nodes of a rectangular lattice by storing and using quantities that are common for several nodes. The algorithm of a uniform search with clustering, the variable metric algorithm and the polytope algorithm are modified.