#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1984

2017

- This year (4)
- Last 5 years (60)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

We consider the problem faced by a company that wants to use viral marketing to introduce a new product into a market where a competing product is already being introduced. We assume that consumers will use only one of the two products and will influence their friends in their decision of which product to use. We propose two models for the spread of… (More)

- Jorge J. Moré, Stefan M. Wild
- SIAM Journal on Optimization
- 2009

We propose data profiles as a tool for analyzing the performance of derivativefree optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and… (More)

- Stefan M. Wild, James Curry, Anne Dougherty
- Pattern Recognition
- 2004

- Stefan M. Wild, Rommel G. Regis, Christine A. Shoemaker
- SIAM J. Scientific Computing
- 2008

We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolating Radial Basis Function (RBF) models is employed. The RBF models considered often allow ORBIT to interpolate nonlinear functions using fewer function evaluations than the polynomial models… (More)

- Prasanna Balaprakash, Ananta Tiwari, Stefan M. Wild
- PMBS@SC
- 2013

Code optimization in the high-performance computing realm has traditionally focused on reducing execution time. The problem, in mathematical terms, has been expressed as a single objective optimization problem. The expected concerns of next-generation systems, however, demand a more detailed analysis of the interplay among execution time and other metrics.… (More)

Empirical performance optimization of computer codes using autotuners has received significant attention in recent years. Given the increased complexity of computer architectures and scientific codes, evaluating all possible code variants is prohibitively expensive for all but the simplest kernels. One way for autotuners to overcome this hurdle is through… (More)

- Robert B. Gramacy, Genetha A. Gray, +4 authors Stefan M. Wild
- 2014

Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literature is sparse, especially in addressing problems with nontrivial constraints. This situation is unfortunate because statistical methods have many attractive properties: global scope, handling noisy… (More)

- Jorge J. Moré, Stefan M. Wild
- ACM Trans. Math. Softw.
- 2012

We employ recent work on computational noise to obtain near-optimal difference estimates of the derivative of a noisy function. Our analysis relies on a stochastic model of the noise without assuming a specific form of distribution. We use this model to derive theoretical bounds for the errors in the difference estimates and obtain an easily computable… (More)

- Stefan M. Wild
- 2008

We introduce MNH, a new algorithm for unconstrained optimization when derivatives are unavailable, primarily targeting applications that require running computationally expensive deterministic simulations. MNH relies on a trust-region framework with an underdetermined quadratic model that interpolates the function at a set of data points. We show how to… (More)

- Stefan M. Wild, Christine A. Shoemaker
- SIAM Review
- 2013

We analyze globally convergent, derivative-free trust-region algorithms relying on radial basis function interpolation models. Our results extend the recent work of Conn, Scheinberg, and Vicente [SIAM J. Optim., 20 (2009), pp. 387–415] to fully linear models that have a nonlinear term. We characterize the types of radial basis functions that fit in our… (More)