Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions docs/Project.toml
Original file line number Diff line number Diff line change
Expand Up @@ -130,6 +130,9 @@ path = "../lib/OptimizationPyCMA"
[sources.OptimizationQuadDIRECT]
path = "../lib/OptimizationQuadDIRECT"

[sources.QuadDIRECT]
url = "https://github.com/timholy/QuadDIRECT.jl.git"

[sources.OptimizationSciPy]
path = "../lib/OptimizationSciPy"

Expand Down
12 changes: 6 additions & 6 deletions docs/src/optimization_packages/evolutionary.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# Evolutionary.jl

[`Evolutionary`](https://github.com/wildart/Evolutionary.jl) is a Julia package implementing various evolutionary and genetic algorithm.
[`Evolutionary`](https://github.com/SciML/Evolutionary.jl) is a Julia package implementing various evolutionary and genetic algorithm.

## Installation: OptimizationEvolutionary.jl

Expand All @@ -15,16 +15,16 @@ Pkg.add("OptimizationEvolutionary");

### Without Constraint Equations

The methods in [`Evolutionary`](https://github.com/wildart/Evolutionary.jl) are performing global optimization on problems without
The methods in [`Evolutionary`](https://github.com/SciML/Evolutionary.jl) are performing global optimization on problems without
constraint equations. These methods work both with and without lower and upper constraints set by `lb` and `ub` in the `OptimizationProblem`.

A `Evolutionary` algorithm is called by one of the following:

- [`Evolutionary.GA()`](https://wildart.github.io/Evolutionary.jl/stable/ga/): **Genetic Algorithm optimizer**
- [`Evolutionary.GA()`](https://sciml.github.io/Evolutionary.jl/stable/ga/): **Genetic Algorithm optimizer**

- [`Evolutionary.DE()`](https://wildart.github.io/Evolutionary.jl/stable/de/): **Differential Evolution optimizer**
- [`Evolutionary.ES()`](https://wildart.github.io/Evolutionary.jl/stable/es/): **Evolution Strategy algorithm**
- [`Evolutionary.CMAES()`](https://wildart.github.io/Evolutionary.jl/stable/cmaes/): **Covariance Matrix Adaptation Evolution Strategy algorithm**
- [`Evolutionary.DE()`](https://sciml.github.io/Evolutionary.jl/stable/de/): **Differential Evolution optimizer**
- [`Evolutionary.ES()`](https://sciml.github.io/Evolutionary.jl/stable/es/): **Evolution Strategy algorithm**
- [`Evolutionary.CMAES()`](https://sciml.github.io/Evolutionary.jl/stable/cmaes/): **Covariance Matrix Adaptation Evolution Strategy algorithm**

Algorithm-specific options are defined as `kwargs`. See the respective documentation for more detail.

Expand Down
2 changes: 1 addition & 1 deletion docs/src/optimization_packages/nlopt.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# NLopt.jl

[`NLopt`](https://github.com/jump-dev/NLopt.jl) is Julia package interfacing to the free/open-source [`NLopt library`](http://ab-initio.mit.edu/nlopt/) which implements many optimization methods both global and local [`NLopt Documentation`](https://nlopt.readthedocs.io/en/latest/NLopt_Algorithms/).
[`NLopt`](https://github.com/jump-dev/NLopt.jl) is Julia package interfacing to the free/open-source [`NLopt library`](https://nlopt.readthedocs.io/en/latest/) which implements many optimization methods both global and local [`NLopt Documentation`](https://nlopt.readthedocs.io/en/latest/NLopt_Algorithms/).

## Installation: OptimizationNLopt.jl

Expand Down
4 changes: 2 additions & 2 deletions lib/SimpleOptimization/src/SimpleOptimization.jl
Original file line number Diff line number Diff line change
Expand Up @@ -181,7 +181,7 @@ function SciMLBase.__solve(cache::OptimizationCache{O}) where {O <: SimpleLBFGS}
nlprob,
SimpleLimitedMemoryBroyden(;
threshold = __get_threshold(cache.opt),
linesearch = Val(false)
linesearch = nothing
);
maxiters = maxiters,
abstol = abstol,
Expand Down Expand Up @@ -222,7 +222,7 @@ function SciMLBase.__solve(cache::OptimizationCache{O}) where {O <: SimpleBFGS}
nlprob = NonlinearProblem(∇f, cache.u0)
nlsol = solve(
nlprob,
SimpleBroyden(; linesearch = Val(false));
SimpleBroyden(; linesearch = nothing);
maxiters = maxiters,
abstol = abstol,
reltol = reltol
Expand Down
Loading