The DIRECT algorithm is a deterministic sampling method for bound constrained Lipschitz continuous optimization. We prove a subsequential convergence result for the DIRECT algorithm that quantifies some of the convergence observations in the literature. Our results apply to several variations on the original method, including one that will handle general constraints. We use techniques from nonsmooth analysis, and our framework is based on recent results for the MADS sampling algorithms.
Citation
Unpublished: N. C. State University Center for Research in Scientific Computation Tech Report number CRSC-TR04-28, July, 2004