Skip to content

Latest commit

 

History

History
10 lines (8 loc) · 384 Bytes

File metadata and controls

10 lines (8 loc) · 384 Bytes

Dikin walk

Implementation of Dikin walk in Python, an algorithm for drawing a nearly uniform sample from a polytope. This is my initial stab at understanding and implementing this algorithm. It has not been thoroughly tested and most likely has bugs.

See "R. Kannan and H. Narayanan, Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming."