This paper addresses the solution of bound-constrained optimization problems using algorithms that require only the availability of objective function values but no derivative information. We refer to these algorithms as derivative-free algorithms. Fueled by a growing number of applications in science and engineering, the development of derivative-free optimization algorithms has long been studied, and it has found renewed interest in recent time. Along with many derivative-free algorithms, many software implementations have also appeared. The paper presents a review of derivative-free algorithms, followed by a systematic comparison of 22 related implementations using a test set of 502 problems. The test bed includes convex and nonconvex problems, smooth as well as nonsmooth problems. The algorithms were tested under the same conditions and ranked under several criteria, including their ability to find near-global solutions for nonconvex problems, improve a given starting point, and refine a near-optimal solution. A total of 112,448 problem instances were solved. We find that the ability of all these solvers to obtain good solutions diminishes with increasing problem size. For the problems used in this study, TOMLAB/MULTIMIN, TOMLAB/GLCCLUSTER, MCS and TOMLAB/LGO are better, on average, than other derivative-free solvers in terms of solution quality within 2,500 function evaluations. These global solvers outperform local solvers even for convex problems. Finally, TOMLAB/OQNLP, NEWUOA, and TOMLAB/MULTIMIN show superior performance in terms of refining a near-optimal solution.

/pdf/derivative-free-optimization-a-review-of-algorithms-and-2qmveq3j89.pdf

Derivative-free optimization: a review of algorithms and comparison of software implementations

Objective functions that appear in engineering practice may come from measurements of physical systems and, more often, from computer simulations. In many cases, optimization of such objectives in a straightforward way, i.e., by applying optimization routines directly to these functions, is impractical. One reason is that simulation-based objective functions are often analytically intractable (discontinuous, non-differentiable, and inherently noisy). Also, sensitivity information is usually unavailable, or too expensive to compute. Another, and in many cases even more important, reason is the high computational cost of measurement/simulations. Simulation times of several hours, days or even weeks per objective function evaluation are not uncommon in contemporary engineering, despite the increase of available computing power. Feasible handling of these unmanageable functions can be accomplished using surrogate models: the optimization of the original objective is replaced by iterative re-optimization and updating of the analytically tractable and computationally cheap surrogate. This chapter briefly describes the basics of surrogate-based optimization, various ways of creating surrogate models, as well as several examples of surrogate-based optimization techniques.

Surrogate-Based Methods

Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO

A review on design of experiments and surrogate models in aircraft real-time and many-query aerodynamic analyses

Polymer flooding has proved economically and technically successful in numerous enhanced oil recovery (EOR) projects, which can often increase oil recovery from 12 to 15 % of the original oil in place. When a reservoir is flooded with viscous polymer solution, the mobility ratio between the displacing fluid (i.e., water) and the displaced fluid (i.e., oil) becomes more favorable if compared to conventional water flooding. Therefore, the volumetric sweep efficiency and correspondingly the overall oil recovery are effectively improved. Currently, there is a widespread idea that polymer flooding is inefficient in improving the microscopic oil displacement (at pore scale). However, recent research based on laboratory studies and pilot field testing has proved otherwise. It seems that the viscoelastic properties of polymeric systems indeed improve the microscopic displacement efficiency of residual oil. This paper reviews and emphasizes the recovery mechanisms that have been proposed to explain oil displacement by polymer flooding within oil reservoirs. The aim of this review is to provide a synopsis of polymer flooding which is rapidly emerging as a popular and advantageous EOR process.

/pdf/oil-displacement-mechanisms-of-viscoelastic-polymers-in-15k446mumm.pdf

Oil displacement mechanisms of viscoelastic polymers in enhanced oil recovery (EOR): a review

Well placement and control optimization in oil field development are commonly performed in a sequential manner. In this work, we propose a joint approach that embeds well control optimization within the search for optimum well placement configurations. We solve for well placement using derivative-free methods based on pattern search. Control optimization is solved by sequential quadratic programming using gradients efficiently computed through adjoints. Joint optimization yields a significant increase, of up to 20% in net present value, when compared to reasonable sequential approaches. The joint approach does, however, require about an order of magnitude increase in the number of objective function evaluations compared to sequential procedures. This increase is somewhat mitigated by the parallel implementation of some of the pattern-search algorithms used in this work. Two pattern-search algorithms using eight and 20 computing cores yield speedup factors of 4.1 and 6.4, respectively. A third pattern-search procedure based on a serial evaluation of the objective function is less efficient in terms of clock time, but the optimized cost function value obtained with this scheme is marginally better.

/pdf/joint-optimization-of-oil-well-placement-and-controls-37yyjzrym9.pdf

Joint optimization of oil well placement and controls

In oil field development, the optimal location for a new well depends on how it is to be operated. Thus, it is generally suboptimal to treat the well location and well control optimization problems separately. Rather, they should be considered simultaneously as a joint problem. In this work, we present noninvasive, derivative-free, easily parallelizable procedures to solve this joint optimization problem. Specifically, we consider Particle Swarm Optimization (PSO), a global stochastic search algorithm; Mesh Adaptive Direct Search (MADS), a local search procedure; and a hybrid PSO–MADS technique that combines the advantages of both methods. Nonlinear constraints are handled through use of filter-based treatments that seek to minimize both the objective function and constraint violation. We also introduce a formulation to determine the optimal number of wells, in addition to their locations and controls, by associating a binary variable (drill/do not drill) with each well. Example cases of varying complexity, which include bound constraints, nonlinear constraints, and the determination of the number of wells, are presented. The PSO–MADS hybrid procedure is shown to consistently outperform both stand-alone PSO and MADS when solving the joint problem. The joint approach is also observed to provide superior performance relative to a sequential procedure.

A derivative-free methodology with local and global search for the constrained joint optimization of well locations and controls

This paper (SPE 141950) was accepted for presentation at the SPE Reservoir Simulation Symposium, The Woodlands, Texas, USA, 21–23 February 2011, and revised for publication. Original manuscript received for review 15 December 2010. Revised manuscript received for review 12 May 2011. Paper peer approved 15 July 2011. Summary Subsurface geology is highly uncertain, and it is necessary to account for this uncertainty when optimizing the location of new wells. This can be accomplished by evaluating reservoir performance for a particular well configuration over multiple realizations of the reservoir and then optimizing based, for example, on expected net present value (NPV) or expected cumulative oil production. A direct procedure for such an optimization would entail the simulation of all realizations at each iteration of the optimization algorithm. This could be prohibitively expensive when it is necessary to use a large number of realizations to capture geological uncertainty. In this work, we apply a procedure that is new within the context of reservoir management—retrospective optimization (RO)—to address this problem. RO solves a sequence of optimization subproblems that contain increasing numbers of realizations. We introduce the use of k -means clustering for selecting these realizations. Three example cases are presented that demonstrate the performance of the RO procedure. These examples use particle swarm optimization (PSO) and simplex linear interpolation (SLI)-based line search as the core optimizers (the RO framework can be used with any underlying optimization algorithm, either stochastic or deterministic). In the first example, we achieve essentially the same optimum using RO as we do using a direct optimization approach, but RO requires an order of magnitude fewer simulations. The results demonstrate the advantages of cluster-based sampling over random sampling for the examples considered. Taken in total, our findings indicate that RO using cluster sampling represents a promising approach for optimizing well locations under geological uncertainty.

David Echeverría Ciaurri

Papers

Surrogate-Based Methods

Joint optimization of oil well placement and controls

A derivative-free methodology with local and global search for the constrained joint optimization of well locations and controls

Optimal Well Placement Under Uncertainty Using a Retrospective Optimization Framework

Generalized Field-Development Optimization With Derivative-Free Procedures