Search space contraction on the basis of nonredundant partition strategy in optimization problems
One of way for extremum search space contraction in case algorithmically the given objective function based on nonredundant partitioning strategy is analyzed. It is shown that the application of the nonredundant one-point-based algorithm provides decrease of temporal costs and computer memory capacity at the expense of trial point’s number contraction in conserving the same requirements by solution accuracy.
Keywords: search space, algorithmically the given objective function, nonredundant partitioning strategy, diagonal algorithms, one-point-based algorithms
