#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2003

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Daniel E. Finkel
- 2003

The purpose of this brief user guide is to introduce the reader to the DIRECT optimization algorithm, describe the type of problems it solves, how to use the accompanying MATLAB program, direct.m, and provide a synopis of how it searches for the global minium. An example of DIRECT being used on a test problem is provided, and the motiviation for the… (More)

- D E Finkel, C T Kelley
- 2004

DIRECT (DIviding RECTangles) [16] is an optimization algorithm designed to aggressively search for global minima of a real valued objective function over a bound-constrained domain. The algorithm does not use derivative information in its search; instead, it relies on the iteration history to determine future sample locations. The strength of DIRECT is the… (More)

- Daniel E. Finkel, C. T. Kelley
- J. Global Optimization
- 2006

- K. R. Fowler, J. P. Reese, +12 authors T. G. Kolda
- 2008

Management decisions involving groundwater supply and remediation often rely on optimization techniques to determine an effective strategy. We introduce several derivative-free sampling methods for solving constrained optimization problems that have not yet been considered in this field, and we include a genetic algorithm for completeness. Two… (More)

- K. R. Fowler, J. P. Reese, +12 authors T. G. Kolda
- 2008

Management decisions involving groundwater supply and remediation often rely on optimization techniques to determine an effective strategy. We introduce several derivative-free sampling methods for solving constrained optimization problems that have not yet been considered in this field, and we include a genetic algorithm for completeness. Two… (More)

- D. E. FINKEL, C. T. KELLEY
- 2008

In this short note we observe that results of Dennis and Audet extend naturally to a wide variety of deterministic sampling methods. For bound-constrained problems, we show that any method based on coordinate search which includes a sufficiently rich set of directions, for example random directions at each state of the sampling, will, when applied to… (More)

- D. E. FINKEL
- 2004

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… (More)

- Daniel E. Finkel, Christopher M. Kuster, Matthew S. Lasater, Rachel Levy, Jill P. Reese, Ilse C. F. Ipsen
- SIAM Review
- 2006

Communicating Applied Mathematics is a writingand speaking-intensive graduate course at North Carolina State University. The purpose of this article is to provide a brief description of the course objectives and the assignments. Parts A–D of of this article represent the class projects and illustrate the outcome of the course: • The Evolution of an… (More)

- ‹
- 1
- ›