A robust implementation of Dykstra's algorithm for the projection onto the intersection of finitely many closed convex sets in a Hilbert space.
-
Updated
Feb 13, 2021 - Python
#
dykstra
Here are 5 public repositories matching this topic...
Used as our groups second semester Advanced Programming and Data Structure project
java graphs data-structures binary-tree r-tree topological-sort hashtable trees searching-algorithms breadth-first-search depth-first-search dykstra
-
Updated
Nov 28, 2022 - Java
C: Ex2 Matrics, Floyd–Warshall & Dykstra algorithms, Shortest-path, Knapspack, Dynamic Programming.
-
Updated
Feb 11, 2024 - C
Improve this page
Add a description, image, and links to the dykstra topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the dykstra topic, visit your repo's landing page and select "manage topics."