Effective discretization strategies in optimal design

Abstract

The authors define a successive approximation algorithm which consists of a sequence of progressively finer stages of discretization, with a prescribed number of iterations of the optimization algorithm carried out in each stage. They associate with the successive approximation algorithm two optimal discretization problems and propose methods for their solutions. They present an implementation scheme based on estimates and show by experiment that it is quite effective.<>