10.06.2016 Views

eldo_user

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Optimization<br />

Eldo Optimizer/Search Algorithm<br />

Note<br />

Specifying an appropriate tolerance on feasibility TOL_FEAS may lead to several savings<br />

by enabling the optimization procedure to terminate when the difference between function<br />

values along the search direction becomes as small as the absolute error in the values.<br />

Computation of Finite-Difference Derivatives<br />

One of the most demanding phases in terms of simulation is the computation of derivatives. The<br />

Eldo optimizer uses finite differences; an approach to calculating the approximate derivatives<br />

coming from Taylor’s theorem. Like many software tools, the Eldo optimizer performs<br />

automatic calculation of finite differences whenever the simulator is unable to supply the code<br />

to compute exact derivatives.<br />

A popular formula for approximating the partial derivative ∂F/∂x at a given point is forward<br />

differences or one-sided differences. The parameter h f controls the interval used to estimate the<br />

gradients of the function F by forward differences:<br />

One-sided difference estimates are used to ensure feasibility with respect to an upper or lower<br />

bound on x. If x is close to an upper bound, the trial intervals will be negative. The final interval<br />

is always positive.<br />

• An approximation to the derivative of F is obtained by evaluating the function F at N + 1<br />

points and performing some elementary arithmetic.<br />

• The resulting gradient estimates should be accurate to O(h f ) unless the functions are<br />

badly scaled.<br />

Related Topics<br />

Eldo Optimizer/Search Algorithm<br />

Eldo Optimizer/Search Algorithm<br />

The Search method is efficient for solving minimization optimization problems that are onedimensional.<br />

This method belongs to the class of derivative free optimization (DFO) algorithms that are<br />

dedicated to solving problems having one variable and one extracted measure. The Dichotomy<br />

and Secant methods also belong to this class. The search method runs faster than the Dichotomy<br />

method and is more robust than the modified Dichotomy (the Eldo optimizer/Secant) method.<br />

Search is based on two distinct algorithms: FIND_ZERO and FIND_MINIMUM.<br />

626<br />

Eldo® User's Manual, 15.3

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!