开源软件名称：

开源软件地址：

开源编程语言：

开源软件介绍：

IntervalOptimisation.jl

Rigorous global optimisation using Julia

This package provides rigorous global optimisation routines written in pure Julia, using interval arithmetic provided by the author's IntervalArithmetic.jl package.

Currently, the package uses an implementation of the Moore-Skelboe algorithm.

Documentation

Documentation for the package is available here.

The best way to learn how to use the package is to look at the tutorial, available in the organisation webpage here.

Usage

Functions minimise and maximise are provided to find the global minimum or maximum, respectively, of a standard Julia function f of one or several variables.

They return an Interval that is guaranteed to contain the global minimum (maximum), and a Vector of Intervals or IntervalBoxes whose union contains all the minimisers.

Examples

1D

using IntervalArithmetic, IntervalOptimisation

julia> @time global_min, minimisers = minimise(x -> (x^2 - 2)^2, -10..11);
  0.046620 seconds (36.07 k allocations: 1.586 MiB)

julia> global_min
[0, 1.50881e-09]

julia> minimisers
2-element Array{IntervalArithmetic.Interval{Float64},1}:
  [1.41387, 1.41453]
 [-1.41428, -1.41363]

2D

julia> @time global_min, minimisers = minimise(  X -> ( (x,y) = X; x^2 + y^2 ),
                                                        (-10000..10001) × (-10000..10001) );
  0.051122 seconds (46.80 k allocations: 2.027 MiB)

julia> global_min
[0, 2.33167e-08]

julia> minimisers
3-element Array{IntervalArithmetic.IntervalBox{2,Float64},1}:
 [-0.000107974, 0.000488103] × [-0.000107974, 0.000488103]
 [-0.000107974, 0.000488103] × [-0.000704051, -0.000107973]
 [-0.000704051, -0.000107973] × [-0.000107974, 0.000488103]

Note that the last two IntervalBoxes do not actually contain the global minimum; decreasing the tolerance (maximum allowed box diameter) removes them:

julia> @time global_min, minimisers = minimise(  X -> ( (x,y) = X; x^2 + y^2 ),
                                                               (-10000..10001) × (-10000..10001), 1e-5 );
  0.047196 seconds (50.72 k allocations: 2.180 MiB)

julia> minimisers
1-element Array{IntervalArithmetic.IntervalBox{2,Float64},1}:
 [-5.52321e-06, 3.79049e-06] × [-5.52321e-06, 3.79049e-06]

Author

• David P. Sanders, Departamento de Física, Facultad de Ciencias, Universidad Nacional Autónoma de México (UNAM)

References:

• Validated Numerics: A Short Introduction to Rigorous Computations, W. Tucker, Princeton University Press (2010)

• Applied Interval Analysis, Luc Jaulin, Michel Kieffer, Olivier Didrit, Eric Walter (2001)

• van Emden M.H., Moa B. (2004). Termination Criteria in the Moore-Skelboe Algorithm for Global Optimization by Interval Arithmetic. In: Floudas C.A., Pardalos P. (eds), Frontiers in Global Optimization. Nonconvex Optimization and Its Applications, vol. 74. Springer, Boston, MA. Preprint

• H. Ratschek and J. Rokne, New Computer Methods for Global Optimization

Acknowledements

Financial support is acknowledged from DGAPA-UNAM PAPIIT grant IN-117117.