A Parallel, Asynchronous Method for Derivative-Free Nonlinear Programs
Derivative-free optimization algorithms are needed to solve real-world engineering problems that have computationally expensive and noisy objective function and constraint evaluations. In particular, we are focused on problems that involve running cumbersome simulation codes with run times measured in hours. In such cases, attempts to compute derivatives can prove futile because analytical derivatives are typically unavailable and noise limits the accuracy of numerical approximations. Furthermore, the objective and constraint functions may be inherently nonsmooth, i.e., because the underlying model is nonsmooth.
Unable to display preview. Download preview PDF.
- 3.Fukuda, K.: cdd and cddplus homepage. From McGill University, Montreal, Canada (2005), Web page: http://www.cs.mcgill.ca/~fukuda/soft/cdd_home/cdd.html
- 4.Gray, G.A., Kolda, T.G.: Algorithm 8xx: APPSPACK 4.0: Asynchronous parallel pattern search for derivative-free optimization. ACM T. Math. Software (to appear)Google Scholar
- 8.Kolda, T.G., Lewis, R.M., Torczon, V.: Stationarity results for generating set search for linearly constrained optimization, Tech. Rep. SAND2003-8550, Sandia National Laboratories. Albuquerque, NM and Livermore, CA (October 2003)Google Scholar
- 9.Kolda, T.G., Lewis, R.M., Torczon, V.: Convergence properties of an augmented Lagrangian direct search algorithm for optimization with a combination of general equality and linear constraints (in preparation, 2005)Google Scholar
- 11.Lewis, R. M., Shepherd, A., Torczon, V.: Implementing generating set search methods for linearly constrained minimization, Tech. Rep. WM-CS-2005-01, Department of Computer Science, College of William & Mary, Williamsburg, Virginia (July 2005)Google Scholar