EfficientGlobalOptimization¶

class EfficientGlobalOptimization(*args)¶

Efficient Global Optimization algorithm.

The EGO algorithm [jones1998] is an adaptative optimization method based on kriging. An initial design of experiment is used to build a first metamodel. At each iteration a new point that maximizes a criterion is chosen as optimizer candidate. The criterion uses a tradeoff between the metamodel value and the conditional variance. Then the new point is evaluated using the original model and the metamodel is relearnt on the extended design of experiment.

Available constructors:: EfficientGlobalOptimization(problem, krigingResult)

Parameters

problemOptimizationProblem: The optimization problem to solve optionally, a 2nd objective marginal can be used as noise
krigingResultKrigingResult: The result of the meta-model on the first design of experiment

Notes

Each point added to the metamodel design seeks to improve the current minimum. We chose the point so as to maximize an improvement criterion based on the metamodel.

$I(x_{new}) = max(f_{min} - Y_{new}, 0)$

The default criteria is called EI (Expected Improvement) and aims at maximizing the mean improvement:

$\mathbb{E}\left[I(x_{new})\right] = \mathbb{E}\left[max(f_{min} - Y_{new}, 0)\right]$

This criterion is explicited using the kriging mean and variance:

$\mathbb{E}\left[I(x_{new})\right] = (f_{min} - m_K(x_{new})) \Phi\left( \frac{f_{min} - m_K(x_{new})}{s_K(x_{new})} \right) + s_K(x_{new}) \phi\left( \frac{f_{min} - m_K(x_{new})}{s_K(x_{new})} \right)$

An observation noise variance can be provided thanks to a 2nd objective marginal.

$Y_{obs} = Y(x) + \sigma_{\epsilon}(x) \epsilon$

In that case the AEI (Augmented Expected Improvement) formulation is used. As we don’t have access to the real minimum of the function anymore a quantile of the kriging prediction is used, with the constant $c$ :

$u(x) = m_K(x) + c s_K(x)$

This criterion is minimized over the design points:

$x_{min} = \argmax_{x_i} (u(x_i))$

The AEI criterion reads:

$AEI(x_{new}) = \mathbb{E}\left[max(m_K(x_{min}) - Y_{new}, 0)\right] \times \left(1 - \frac{\sigma_{\epsilon}(x_{new})}{\sqrt{\sigma_{\epsilon}^2(x_{new})+s^2_K(x_{new})}} \right)$

with

$\mathbb{E}\left[max(m_K(x_{min}) - Y_{new}, 0)\right] = (m_K(x_{min}) - m_K(x_{new})) \Phi\left( \frac{m_K(x_{min}) - m_K(x_{new})}{s_K(x_{new})} \right) + s_K(x_{new}) \phi\left( \frac{m_K(x_{min}) - m_K(x_{new})}{s_K(x_{new})} \right)$

A less computationally expensive noise function can be provided through setNoiseModel() to evaluate $\sigma^2_{\epsilon}(x)$ for the improvement criterion optimization, the objective being only used to compute values and associated noise at design points.

By default the criteria is minimized using MultiStart with starting points uniformly sampled in the optimization problem bounds, see setMultiStartExperimentSize() and setMultiStartNumber(). This behavior can be overridden by using another solver with setOptimizationAlgorithm().

Examples

>>> import openturns as ot
>>> ot.RandomGenerator.SetSeed(0)
>>> dim = 4
>>> model = ot.SymbolicFunction(['x1', 'x2', 'x3', 'x4'],
...     ['x1*x1+x2^3*x1+x3+x4'])
>>> model = ot.MemoizeFunction(model)
>>> bounds = ot.Interval([-5.0] * dim, [5.0] * dim)
>>> problem = ot.OptimizationProblem()
>>> problem.setObjective(model)
>>> problem.setBounds(bounds)
>>> experiment = ot.Composite([0.0] * dim, [1.0, 2.0, 4.0])
>>> inputSample = experiment.generate()
>>> outputSample = model(inputSample)
>>> covarianceModel = ot.SquaredExponential([2.0] * dim, [0.1])
>>> basis = ot.ConstantBasisFactory(dim).build()
>>> kriging = ot.KrigingAlgorithm(inputSample, outputSample, covarianceModel, basis)
>>> kriging.run()
>>> algo = ot.EfficientGlobalOptimization(problem, kriging.getResult())
>>> algo.setMaximumEvaluationNumber(2)
>>> algo.run()
>>> result = algo.getResult()

Methods

`computeLagrangeMultipliers`(self, x)	Compute the Lagrange multipliers of a problem at a given point.
`getAEITradeoff`(self)	AEI tradeoff constant accessor.
`getClassName`(self)	Accessor to the object’s name.
`getCorrelationLengthFactor`(self)	Correlation length stopping criterion factor accessor.
`getExpectedImprovement`(self)	Expected improvement values.
`getId`(self)	Accessor to the object’s id.
`getImprovementFactor`(self)	Improvement criterion factor accessor.
`getMaximumAbsoluteError`(self)	Accessor to maximum allowed absolute error.
`getMaximumConstraintError`(self)	Accessor to maximum allowed constraint error.
`getMaximumEvaluationNumber`(self)	Accessor to maximum allowed number of evaluations.
`getMaximumIterationNumber`(self)	Accessor to maximum allowed number of iterations.
`getMaximumRelativeError`(self)	Accessor to maximum allowed relative error.
`getMaximumResidualError`(self)	Accessor to maximum allowed residual error.
`getMultiStartExperimentSize`(self)	Size of the design to draw starting points.
`getMultiStartNumber`(self)	Number of starting points for the criterion optimization.
`getName`(self)	Accessor to the object’s name.
`getNoiseModel`(self)	Improvement noise model accessor.
`getOptimizationAlgorithm`(self)	Expected improvement solver accessor.
`getParameterEstimationPeriod`(self)	Parameter estimation period accessor.
`getProblem`(self)	Accessor to optimization problem.
`getResult`(self)	Accessor to optimization result.
`getShadowedId`(self)	Accessor to the object’s shadowed id.
`getStartingPoint`(self)	Accessor to starting point.
`getVerbose`(self)	Accessor to the verbosity flag.
`getVisibility`(self)	Accessor to the object’s visibility state.
`hasName`(self)	Test if the object is named.
`hasVisibleName`(self)	Test if the object has a distinguishable name.
`run`(self)	Launch the optimization.
`setAEITradeoff`(self, c)	AEI tradeoff constant accessor.
`setCorrelationLengthFactor`(self, b)	Correlation length stopping criterion factor accessor.
`setImprovementFactor`(self, improvementFactor)	Improvement criterion factor accessor.
`setMaximumAbsoluteError`(self, …)	Accessor to maximum allowed absolute error.
`setMaximumConstraintError`(self, …)	Accessor to maximum allowed constraint error.
`setMaximumEvaluationNumber`(self, …)	Accessor to maximum allowed number of evaluations.
`setMaximumIterationNumber`(self, …)	Accessor to maximum allowed number of iterations.
`setMaximumRelativeError`(self, …)	Accessor to maximum allowed relative error.
`setMaximumResidualError`(self, …)	Accessor to maximum allowed residual error.
`setMultiStartExperimentSize`(self, …)	Size of the design to draw starting points.
`setMultiStartNumber`(self, multiStartNumberSize)	Number of starting points for the criterion optimization.
`setName`(self, name)	Accessor to the object’s name.
`setNoiseModel`(self, noiseModel)	Improvement noise model accessor.
`setOptimizationAlgorithm`(self, solver)	Expected improvement solver accessor.
`setParameterEstimationPeriod`(self, …)	Parameter estimation period accessor.
`setProblem`(self, problem)	Accessor to optimization problem.
`setProgressCallback`(self, \*args)	Set up a progress callback.
`setResult`(self, result)	Accessor to optimization result.
`setShadowedId`(self, id)	Accessor to the object’s shadowed id.
`setStartingPoint`(self, startingPoint)	Accessor to starting point.
`setStopCallback`(self, \*args)	Set up a stop callback.
`setVerbose`(self, verbose)	Accessor to the verbosity flag.
`setVisibility`(self, visible)	Accessor to the object’s visibility state.

__init__(self, \*args)¶: Initialize self. See help(type(self)) for accurate signature.

computeLagrangeMultipliers(self, x)¶

Compute the Lagrange multipliers of a problem at a given point.

Parameters

xsequence of float: Point at which the Lagrange multipliers are computed.

Returns

lagrangeMultipliersequence of float: Lagrange multipliers of the problem at the given point.

Notes

The Lagrange multipliers $\vect{\lambda}$ are associated with the following Lagrangian formulation of the optimization problem:

$\cL(\vect{x}, \vect{\lambda}_{eq}, \vect{\lambda}_{\ell}, \vect{\lambda}_{u}, \vect{\lambda}_{ineq}) = J(\vect{x}) + \Tr{\vect{\lambda}}_{eq} g(\vect{x}) + \Tr{\vect{\lambda}}_{\ell} (\vect{x}-\vect{\ell})^{+} + \Tr{\vect{\lambda}}_{u} (\vect{u}-\vect{x})^{+} + \Tr{\vect{\lambda}}_{ineq} h^{+}(\vect{x})$

where $\vect{\alpha}^{+}=(\max(0,\alpha_1),\hdots,\max(0,\alpha_n))$ .

The Lagrange multipliers are stored as $(\vect{\lambda}_{eq}, \vect{\lambda}_{\ell}, \vect{\lambda}_{u}, \vect{\lambda}_{ineq})$ , where:

$\vect{\lambda}_{eq}$ is of dimension 0 if there is no equality constraint, else of dimension the dimension of $g(\vect{x})$ ie the number of scalar equality constraints
$\vect{\lambda}_{\ell}$ and $\vect{\lambda}_{u}$ are of dimension 0 if there is no bound constraint, else of dimension of $\vect{x}$
$\vect{\lambda}_{eq}$ is of dimension 0 if there is no inequality constraint, else of dimension the dimension of $h(\vect{x})$ ie the number of scalar inequality constraints

The vector $\vect{\lambda}$ is solution of the following linear system:

$\Tr{\vect{\lambda}}_{eq}\left[\dfrac{\partial g}{\partial\vect{x}}(\vect{x})\right]+ \Tr{\vect{\lambda}}_{\ell}\left[\dfrac{\partial (\vect{x}-\vect{\ell})^{+}}{\partial\vect{x}}(\vect{x})\right]+ \Tr{\vect{\lambda}}_{u}\left[\dfrac{\partial (\vect{u}-\vect{x})^{+}}{\partial\vect{x}}(\vect{x})\right]+ \Tr{\vect{\lambda}}_{ineq}\left[\dfrac{\partial h}{\partial\vect{x}}(\vect{x})\right]=-\dfrac{\partial J}{\partial\vect{x}}(\vect{x})$

If there is no constraint of any kind, $\vect{\lambda}$ is of dimension 0, as well as if no constraint is active.

getAEITradeoff(self)¶

AEI tradeoff constant accessor.

Returns

cfloat: Used to define a quantile of the kriging prediction at the design points. $u(x)=m_K(x)+c*s_K(x)$

getClassName(self)¶

Accessor to the object’s name.

Returns

class_namestr: The object class name (object.__class__.__name__).

getCorrelationLengthFactor(self)¶

Correlation length stopping criterion factor accessor.

When a correlation length becomes smaller than the minimal distance between design point for a single component that means the model tends to be noisy, and the EGO formulation is not adapted anymore.

Returns

bfloat: Used to define a stopping criterion on the minimum correlation length: $\theta_i < \frac{\Delta_i^{min}}{b}$ with $\Delta^{min}$ the minimum distance between design points.

getExpectedImprovement(self)¶

Expected improvement values.

Returns

eiSample: The expected improvement optimal values.

getId(self)¶

Accessor to the object’s id.

Returns

idint: Internal unique identifier.

getImprovementFactor(self)¶

Improvement criterion factor accessor.

Returns

alphapositive float, default=0.0 (disables the criterion): Used to define a stopping criterion on the improvement criterion: $I_{max} < \alpha |Y_{min}|$ with $I_{max}$ the current maximum of the improvement and $Y_{min}$ the current optimum.

getMaximumAbsoluteError(self)¶

Accessor to maximum allowed absolute error.

Returns

maximumAbsoluteErrorfloat: Maximum allowed absolute error, where the absolute error is defined by $\epsilon^a_n=\|\vect{x}_{n+1}-\vect{x}_n\|_{\infty}$ where $\vect{x}_{n+1}$ and $\vect{x}_n$ are two consecutive approximations of the optimum.

getMaximumConstraintError(self)¶

Accessor to maximum allowed constraint error.

Returns

maximumConstraintErrorfloat: Maximum allowed constraint error, where the constraint error is defined by $\gamma_n=\|g(\vect{x}_n)\|_{\infty}$ where $\vect{x}_n$ is the current approximation of the optimum and $g$ is the function that gathers all the equality and inequality constraints (violated values only)

getMaximumEvaluationNumber(self)¶

Accessor to maximum allowed number of evaluations.

Returns

Nint: Maximum allowed number of evaluations.

getMaximumIterationNumber(self)¶

Accessor to maximum allowed number of iterations.

Returns

Nint: Maximum allowed number of iterations.

getMaximumRelativeError(self)¶

Accessor to maximum allowed relative error.

Returns

maximumRelativeErrorfloat: Maximum allowed relative error, where the relative error is defined by $\epsilon^r_n=\epsilon^a_n/\|\vect{x}_{n+1}\|_{\infty}$ if $\|\vect{x}_{n+1}\|_{\infty}\neq 0$ , else $\epsilon^r_n=-1$ .

getMaximumResidualError(self)¶

Accessor to maximum allowed residual error.

Returns

maximumResidualErrorfloat: Maximum allowed residual error, where the residual error is defined by $\epsilon^r_n=\frac{\|f(\vect{x}_{n+1})-f(\vect{x}_{n})\|}{\|f(\vect{x}_{n+1})\|}$ if $\|f(\vect{x}_{n+1})\|\neq 0$ , else $\epsilon^r_n=-1$ .

getMultiStartExperimentSize(self)¶

Size of the design to draw starting points.

Returns

multiStartExperimentSizeint: The size of the Monte Carlo design from which to select the best starting points.

getMultiStartNumber(self)¶

Number of starting points for the criterion optimization.

Returns

multiStartNumberint: The number of starting points for the criterion optimization.

getName(self)¶

Accessor to the object’s name.

Returns

namestr: The name of the object.

getNoiseModel(self)¶

Improvement noise model accessor.

Returns

noiseVarianceFunction: The noise variance $\sigma^2_{\epsilon}(x)$ used for the AEI criterion optimization only. Of same input dimension than the objective and 1-d output.

getOptimizationAlgorithm(self)¶

Expected improvement solver accessor.

Returns

solverOptimizationSolver: The solver used to optimize the expected improvement

getParameterEstimationPeriod(self)¶

Parameter estimation period accessor.

Returns

periodint: The number of iterations between covariance parameters re-learn. Default is 1 (each iteration). Can be set to 0 (never).

getProblem(self)¶

Accessor to optimization problem.

Returns

problemOptimizationProblem: Optimization problem.

getResult(self)¶

Accessor to optimization result.

Returns

resultOptimizationResult: Result class.

getShadowedId(self)¶

Accessor to the object’s shadowed id.

Returns

idint: Internal unique identifier.

getStartingPoint(self)¶

Accessor to starting point.

Returns

startingPointPoint: Starting point.

getVerbose(self)¶

Accessor to the verbosity flag.

Returns

verbosebool: Verbosity flag state.

getVisibility(self)¶

Accessor to the object’s visibility state.

Returns

visiblebool: Visibility flag.

hasName(self)¶

Test if the object is named.

Returns

hasNamebool: True if the name is not empty.

hasVisibleName(self)¶

Test if the object has a distinguishable name.

Returns

hasVisibleNamebool: True if the name is not empty and not the default one.

run(self)¶: Launch the optimization.

setAEITradeoff(self, c)¶

AEI tradeoff constant accessor.

Parameters

cfloat: Used to define a quantile of the kriging prediction at the design points. $u(x)=m_K(x)+c*s_K(x)$

setCorrelationLengthFactor(self, b)¶

Correlation length stopping criterion factor accessor.

When a correlation length becomes smaller than the minimal distance between design point for a single component that means the model tends to be noisy, and the EGO formulation is not adapted anymore.

Parameters

bfloat: Used to define a stopping criterion on the minimum correlation length: $\theta_i < \frac{\Delta_i^{min}}{b}$ with $\Delta^{min}$ the minimum distance between design points.

setImprovementFactor(self, improvementFactor)¶

Improvement criterion factor accessor.

Parameters

alphapositive float, default=0.0 (disables the criterion): Used to define a stopping criterion on the improvement criterion: $I_{max} < \alpha |Y_{min}|$ with $I_{max}$ the current maximum of the improvement and $Y_{min}$ the current optimum.

setMaximumAbsoluteError(self, maximumAbsoluteError)¶

Accessor to maximum allowed absolute error.

Parameters

maximumAbsoluteErrorfloat: Maximum allowed absolute error, where the absolute error is defined by $\epsilon^a_n=\|\vect{x}_{n+1}-\vect{x}_n\|_{\infty}$ where $\vect{x}_{n+1}$ and $\vect{x}_n$ are two consecutive approximations of the optimum.

setMaximumConstraintError(self, maximumConstraintError)¶

Accessor to maximum allowed constraint error.

Parameters

maximumConstraintErrorfloat: Maximum allowed constraint error, where the constraint error is defined by $\gamma_n=\|g(\vect{x}_n)\|_{\infty}$ where $\vect{x}_n$ is the current approximation of the optimum and $g$ is the function that gathers all the equality and inequality constraints (violated values only)

setMaximumEvaluationNumber(self, maximumEvaluationNumber)¶

Accessor to maximum allowed number of evaluations.

Parameters

Nint: Maximum allowed number of evaluations.

setMaximumIterationNumber(self, maximumIterationNumber)¶

Accessor to maximum allowed number of iterations.

Parameters

Nint: Maximum allowed number of iterations.

setMaximumRelativeError(self, maximumRelativeError)¶

Accessor to maximum allowed relative error.

Parameters

maximumRelativeErrorfloat: Maximum allowed relative error, where the relative error is defined by $\epsilon^r_n=\epsilon^a_n/\|\vect{x}_{n+1}\|_{\infty}$ if $\|\vect{x}_{n+1}\|_{\infty}\neq 0$ , else $\epsilon^r_n=-1$ .

setMaximumResidualError(self, maximumResidualError)¶

Accessor to maximum allowed residual error.

Parameters

Maximum allowed residual error, where the residual error is defined by: $\epsilon^r_n=\frac{\|f(\vect{x}_{n+1})-f(\vect{x}_{n})\|}{\|f(\vect{x}_{n+1})\|}$ if $\|f(\vect{x}_{n+1})\|\neq 0$ , else $\epsilon^r_n=-1$ .

setMultiStartExperimentSize(self, multiStartExperimentSize)¶

Size of the design to draw starting points.

Parameters

multiStartExperimentSizeint: The size of the Monte Carlo design from which to select the best starting points. The default number can be tweaked with the EfficientGlobalOptimization-DefaultMultiStartExperimentSize key from ResourceMap.

setMultiStartNumber(self, multiStartNumberSize)¶

Number of starting points for the criterion optimization.

Parameters

multiStartNumberint: The number of starting points for the criterion optimization. The default number can be tweaked with the EfficientGlobalOptimization-DefaultMultiStartNumber key from ResourceMap.

setName(self, name)¶

Accessor to the object’s name.

Parameters

namestr: The name of the object.

setNoiseModel(self, noiseModel)¶

Improvement noise model accessor.

Parameters

noiseVarianceFunction: The noise variance $\sigma^2_{\epsilon}(x)$ used for the AEI criterion optimization only. Of same input dimension than the objective and 1-d output.

setOptimizationAlgorithm(self, solver)¶

Expected improvement solver accessor.

Parameters

solverOptimizationSolver: The solver used to optimize the expected improvement

setParameterEstimationPeriod(self, parameterEstimationPeriod)¶

Parameter estimation period accessor.

Parameters

periodint: The number of iterations between covariance parameters re-learn. Default is 1 (each iteration). Can be set to 0 (never). The default number can be tweaked with the EfficientGlobalOptimization-DefaultParameterEstimationPeriod key from ResourceMap.

setProblem(self, problem)¶

Accessor to optimization problem.

Parameters

problemOptimizationProblem: Optimization problem.

setProgressCallback(self, \*args)¶

Set up a progress callback.

Can be used to programmatically report the progress of an optimization.

Parameters

callbackcallable: Takes a float as argument as percentage of progress.

Examples

>>> import sys
>>> import openturns as ot
>>> rosenbrock = ot.SymbolicFunction(['x1', 'x2'], ['(1-x1)^2+100*(x2-x1^2)^2'])
>>> problem = ot.OptimizationProblem(rosenbrock)
>>> solver = ot.OptimizationAlgorithm(problem)
>>> solver.setStartingPoint([0, 0])
>>> solver.setMaximumResidualError(1.e-3)
>>> solver.setMaximumIterationNumber(100)
>>> def report_progress(progress):
...     sys.stderr.write('-- progress=' + str(progress) + '%\n')
>>> solver.setProgressCallback(report_progress)
>>> solver.run()

setResult(self, result)¶

Accessor to optimization result.

Parameters

resultOptimizationResult: Result class.

setShadowedId(self, id)¶

Accessor to the object’s shadowed id.

Parameters

idint: Internal unique identifier.

setStartingPoint(self, startingPoint)¶

Accessor to starting point.

Parameters

startingPointPoint: Starting point.

setStopCallback(self, \*args)¶

Set up a stop callback.

Can be used to programmatically stop an optimization.

Parameters

callbackcallable: Returns an int deciding whether to stop or continue.

Examples

>>> import openturns as ot
>>> rosenbrock = ot.SymbolicFunction(['x1', 'x2'], ['(1-x1)^2+100*(x2-x1^2)^2'])
>>> problem = ot.OptimizationProblem(rosenbrock)
>>> solver = ot.OptimizationAlgorithm(problem)
>>> solver.setStartingPoint([0, 0])
>>> solver.setMaximumResidualError(1.e-3)
>>> solver.setMaximumIterationNumber(100)
>>> def ask_stop():
...     return True
>>> solver.setStopCallback(ask_stop)
>>> solver.run()

setVerbose(self, verbose)¶

Accessor to the verbosity flag.

Parameters

verbosebool: Verbosity flag state.

setVisibility(self, visible)¶

Accessor to the object’s visibility state.

Parameters

visiblebool: Visibility flag.

OpenTURNS

An Open source initiative for the Treatment of Uncertainties, Risks'N Statistics

Previous topic

Next topic

This Page

EfficientGlobalOptimization¶