Direct optimization algorithm user guide

By Daniel E. Finkel. 2003

242 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Active Policy Learning for Robot Planning and Exploration under Uncertainty (2007, background): “Another motivating factor is that DIRECT’s implementation is easily available [ 32 ].”
A particle swarm pattern search method for bound constrained global optimization (2007, methodology): “One can clearly see from Table 1 that PSwarm required fewer function evaluations than DIRECT or ASA.”
A Bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot (2009, methodology): “To optimize the expected improvement function, we used the DIRect algorithm [Jones et al (1993); Finkel (2003); Gablonsky (2001)], though other methods such as sequential quadratic programming could also be adopted.”
Self-Avoiding Random Dynamics on Integer Complex Systems (2011, methodology): “There are several good ways of optimizing the acquisition function, including the method of DIvided RECTangles (DIRECT) of [Finkel 2003] and many versions of the projected Newton methods of [Bertsekas 1982].”
Adaptive MCMC with Bayesian Optimization (2012, methodology): “There are several good ways of optimizing the acquisition function, including the method of DIvided RECTangles (DIRECT) of Finkel (2003) and many versions of the projected Newton methods of Bertsekas (1982).”
Active Policy Learning for Robot Planning and Exploration under Uncertainty (2008, background): “Another motivating factor is that DIRECT’s implementation is easily available [40].”