Implicit Filtering

Implicit Filtering

Implicit filtering is a steepest descent algorithm for noisy optimization problems with bound constraints. The method is intended for problems with optimization landscapes that look like the image above ( i.e. with many local minima).

This project is supported by the National Science Foundation.

The details are in the new Implicit Filtering Book , SIAM 2011. Check out the codes for noisy problems in FORTRAN or MATLAB .

The group working on implicit filtering and related algorithms (eg Nelder-Mead, DIRECT, Hooke-Jeeves) and their applications is