Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Fede_V
on Jan 20, 2015
|
parent
|
context
|
favorite
| on:
The Simulated Annealing Algorithm
The local minimization step does not have to be gradient based. You could use something like Nelder-Mead to do the local minimization step, and still use an annealing schedule to decide whether to accept or reject that particular minima.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: