aboutsummaryrefslogtreecommitdiff
path: root/academic/dwave-greedy/README
diff options
context:
space:
mode:
authorWilliam PC <w_calandrini[at]hotmail[dot]com>2022-11-06 18:38:27 +0000
committerWilly Sudiarto Raharjo <willysr@slackbuilds.org>2022-11-12 22:32:58 +0700
commitde25b7e85426e469ffb7142ad5337fa971afb9ef (patch)
tree7dab2edb77bae035927f7bcc2087526304c80a2e /academic/dwave-greedy/README
parent9dfe339bc5aa1c7077c63cf347cfc3335e65b855 (diff)
academic/dwave-greedy: Added (steepest descent solver for (BQM))
Signed-off-by: Willy Sudiarto Raharjo <willysr@slackbuilds.org>
Diffstat (limited to 'academic/dwave-greedy/README')
-rw-r--r--academic/dwave-greedy/README13
1 files changed, 13 insertions, 0 deletions
diff --git a/academic/dwave-greedy/README b/academic/dwave-greedy/README
new file mode 100644
index 0000000000..3e3fb8d475
--- /dev/null
+++ b/academic/dwave-greedy/README
@@ -0,0 +1,13 @@
+ An implementation of a steepest descent solver for binary quadratic
+models.
+
+ Steepest descent is the discrete analogue of gradient descent, but
+the best move is computed using a local minimization rather rather
+than computing a gradient. At each step, we determine the dimension
+along which to descend based on the highest energy drop caused by a
+variable flip.
+
+
+ Optional building mode set with environment variables:
+ - TESTS=yes (performs tests, requires dimod)
+