This page is under construction.
Direct search methods are a class of algorithms for nonlinear optimization that do not explicitly use derivatives of the function being minimized nor the functions defining the constraints in the optimization problem. This feature makes them attractive and useful in many applications such as those that arise in engineering optimization.
My publications on direct search may be found here.
Last updated at Sunday, 14-Jun-2009 07:36:58 EDT.
Copyright © Robert Michael Lewis. All Rights Reserved.