|
1 |
| - |
2 | 1 | struct NullData end
|
3 | 2 | const DEFAULT_DATA = Iterators.cycle((NullData(),))
|
4 | 3 | Base.iterate(::NullData, i=1) = nothing
|
@@ -66,7 +65,7 @@ macro withprogress(progress, exprs...)
|
66 | 65 |
|
67 | 66 | function __solve(prob::OptimizationProblem, opt, data = DEFAULT_DATA;
|
68 | 67 | cb = (args...) -> (false), maxiters::Number = 1000,
|
69 |
| - progress = true, save_best = true, kwargs...) |
| 68 | + progress = false, save_best = true, kwargs...) |
70 | 69 |
|
71 | 70 | if maxiters <= 0.0
|
72 | 71 | error("The number of maxiters has to be a non-negative and non-zero number.")
|
|
159 | 158 | decompose_trace(trace::Optim.OptimizationTrace) = last(trace)
|
160 | 159 | decompose_trace(trace) = trace
|
161 | 160 |
|
162 |
| -function __solve(prob::OptimizationProblem, opt::Optim.AbstractOptimizer, data = DEFAULT_DATA;cb = (args...) -> (false), maxiters::Number = 1000, kwargs...) |
| 161 | +function __solve(prob::OptimizationProblem, opt::Optim.AbstractOptimizer, |
| 162 | + data = DEFAULT_DATA;cb = (args...) -> (false), |
| 163 | + progress = false, |
| 164 | + maxiters::Number = 1000, kwargs...) |
163 | 165 | local x, cur, state
|
164 | 166 |
|
165 | 167 | if data != DEFAULT_DATA
|
@@ -208,7 +210,11 @@ function __solve(prob::OptimizationProblem, opt::Optim.AbstractOptimizer, data =
|
208 | 210 | Optim.optimize(optim_f, prob.u0, opt, Optim.Options(;extended_trace = true, callback = _cb, iterations = maxiters, kwargs...))
|
209 | 211 | end
|
210 | 212 |
|
211 |
| -function __solve(prob::OptimizationProblem, opt::Union{Optim.Fminbox,Optim.SAMIN}, data = DEFAULT_DATA;cb = (args...) -> (false), maxiters::Number = 1000, kwargs...) |
| 213 | +function __solve(prob::OptimizationProblem, opt::Union{Optim.Fminbox,Optim.SAMIN}, |
| 214 | + data = DEFAULT_DATA;cb = (args...) -> (false), |
| 215 | + progress = false, |
| 216 | + maxiters::Number = 1000, kwargs...) |
| 217 | + |
212 | 218 | local x, cur, state
|
213 | 219 |
|
214 | 220 | if data != DEFAULT_DATA
|
@@ -253,7 +259,11 @@ function __solve(prob::OptimizationProblem, opt::Union{Optim.Fminbox,Optim.SAMIN
|
253 | 259 | end
|
254 | 260 |
|
255 | 261 |
|
256 |
| -function __solve(prob::OptimizationProblem, opt::Optim.ConstrainedOptimizer, data = DEFAULT_DATA;cb = (args...) -> (false), maxiters::Number = 1000, kwargs...) |
| 262 | +function __solve(prob::OptimizationProblem, opt::Optim.ConstrainedOptimizer, |
| 263 | + data = DEFAULT_DATA;cb = (args...) -> (false), |
| 264 | + progress = false, |
| 265 | + maxiters::Number = 1000, kwargs...) |
| 266 | + |
257 | 267 | local x, cur, state
|
258 | 268 |
|
259 | 269 | if data != DEFAULT_DATA
|
@@ -327,7 +337,10 @@ function __init__()
|
327 | 337 | BBO() = BBO(:adaptive_de_rand_1_bin_radiuslimited) # the recommended optimizer as default
|
328 | 338 |
|
329 | 339 |
|
330 |
| - function __solve(prob::OptimizationProblem, opt::BBO, data = DEFAULT_DATA; cb = (args...) -> (false), maxiters::Number = 1000, kwargs...) |
| 340 | + function __solve(prob::OptimizationProblem, opt::BBO, data = DEFAULT_DATA; |
| 341 | + cb = (args...) -> (false), maxiters::Number = 1000, |
| 342 | + progress = false, kwargs...) |
| 343 | + |
331 | 344 | local x, cur, state
|
332 | 345 |
|
333 | 346 | if data != DEFAULT_DATA
|
@@ -394,7 +407,10 @@ function __init__()
|
394 | 407 | end
|
395 | 408 |
|
396 | 409 | @require NLopt="76087f3c-5699-56af-9a33-bf431cd00edd" begin
|
397 |
| - function __solve(prob::OptimizationProblem, opt::NLopt.Opt; maxiters::Number = 1000, nstart = 1, local_method = nothing, kwargs...) |
| 410 | + function __solve(prob::OptimizationProblem, opt::NLopt.Opt; |
| 411 | + maxiters::Number = 1000, nstart = 1, |
| 412 | + local_method = nothing, |
| 413 | + progress = false, kwargs...) |
398 | 414 | local x
|
399 | 415 |
|
400 | 416 | if maxiters <= 0.0
|
@@ -470,7 +486,9 @@ function __init__()
|
470 | 486 | end
|
471 | 487 |
|
472 | 488 | @require MultistartOptimization = "3933049c-43be-478e-a8bb-6e0f7fd53575" begin
|
473 |
| - function __solve(prob::OptimizationProblem, opt::MultistartOptimization.TikTak; local_method, local_maxiters::Number = 1000, kwargs...) |
| 489 | + function __solve(prob::OptimizationProblem, opt::MultistartOptimization.TikTak; |
| 490 | + local_method, local_maxiters::Number = 1000, |
| 491 | + progress = false, kwargs...) |
474 | 492 | local x, _loss
|
475 | 493 |
|
476 | 494 | if local_maxiters <= 0.0
|
@@ -530,7 +548,9 @@ function __init__()
|
530 | 548 | struct QuadDirect
|
531 | 549 | end
|
532 | 550 |
|
533 |
| - function __solve(prob::OptimizationProblem, opt::QuadDirect; splits, maxiters::Number = 1000, kwargs...) |
| 551 | + function __solve(prob::OptimizationProblem, opt::QuadDirect; splits, |
| 552 | + maxiters::Number = 1000, |
| 553 | + progress = false, kwargs...) |
534 | 554 | local x, _loss
|
535 | 555 |
|
536 | 556 | if maxiters <= 0.0
|
@@ -588,7 +608,9 @@ function __init__()
|
588 | 608 | record["x"] = population
|
589 | 609 | end
|
590 | 610 |
|
591 |
| - function __solve(prob::OptimizationProblem, opt::Evolutionary.AbstractOptimizer, data = DEFAULT_DATA; cb = (args...) -> (false), maxiters::Number = 1000, kwargs...) |
| 611 | + function __solve(prob::OptimizationProblem, opt::Evolutionary.AbstractOptimizer, data = DEFAULT_DATA; |
| 612 | + cb = (args...) -> (false), maxiters::Number = 1000, |
| 613 | + progress = false, kwargs...) |
592 | 614 | local x, cur, state
|
593 | 615 |
|
594 | 616 | if data != DEFAULT_DATA
|
@@ -624,7 +646,9 @@ function __init__()
|
624 | 646 |
|
625 | 647 | struct CMAEvolutionStrategyOpt end
|
626 | 648 |
|
627 |
| - function __solve(prob::OptimizationProblem, opt::CMAEvolutionStrategyOpt, data = DEFAULT_DATA; cb = (args...) -> (false), maxiters::Number = 1000, kwargs...) |
| 649 | + function __solve(prob::OptimizationProblem, opt::CMAEvolutionStrategyOpt, data = DEFAULT_DATA; |
| 650 | + cb = (args...) -> (false), maxiters::Number = 1000, |
| 651 | + progress = false, kwargs...) |
628 | 652 | local x, cur, state
|
629 | 653 |
|
630 | 654 | if data != DEFAULT_DATA
|
|
0 commit comments