Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update simulated_annealing.md documentation to avoid pointing to a very old issue. #1116

Merged
merged 1 commit into from
Nov 12, 2024
Merged

Update simulated_annealing.md documentation to avoid pointing to a very old issue. #1116

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
8 changes: 5 additions & 3 deletions docs/src/algo/simulated_annealing.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -49,9 +49,11 @@ to disentangle the role of the different components of the algorithm. For exampl
functional form of the acceptance function, the temperature and (indirectly) the neighbor
function determine if the next draw of `x` is accepted or not.

The current implementation of Simulated Annealing is very rough. It lacks quite
a few features which are normally part of a proper SA implementation.
A better implementation is under way, see [this issue](https://github.com/JuliaNLSolvers/Optim.jl/issues/200).
This implementation of Simulated Annealing is a quite simple version of Simulated Annealing
without many bells and whistles. In Optim.jl, we also have the `SAMIN` algorithm implemented.
Consider reading the docstring or documentation page for `SAMIN` to learn about an alternative
Simulated Annealing implementation that additionally allows you to set bounds on the sampling
domain.

## Example

Expand Down
Loading