Diagonal Approach and Efficient Diagonal Partitions

Abstract

To extend one-dimensional algorithms to the multidimensional case, a class of diagonal algorithms thoroughly studied by the authors in the last years is considered in this Chapter. An efficient strategy, which is applied for partitioning the search domain, is described and compared with the existing diagonal partition strategies. This non-redundant diagonal strategy allows one to obtain significant speedup on the required expensive function evaluations with respect to traditional techniques.

The first rule of any technology used in a business is that automation applied to an efficient operation will magnify the efficiency. The second is that automation applied to an inefficient operation will magnify the inefficiency.

Bill Gates