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
A robust implementation of Dykstra's algorithm for the projection onto the intersection of finitely many closed convex sets in a Hilbert space.
Rank preserving calibration of multiclass prob.
Used as our groups second semester Advanced Programming and Data Structure project
C: Ex2 Matrics, Floyd–Warshall & Dykstra algorithms, Shortest-path, Knapspack, Dynamic Programming.
To associate your repository with the dykstra topic, visit your repo's landing page and select "manage topics."