Performance improvements to dual simplex: BFRT, hypersparsity, basis updates, primal infeasible list#192

Merged

rapids-bot[bot] merged 33 commits intoNVIDIA:branch-25.08from

chris-maes:hypersparsity

Jul 31, 2025

Commits on Jun 11, 2025

Fix accidental O(N^2) BFRT with O(N log N). 13% better on NETLIB
chris-maes
committed

Commits on Jun 12, 2025

Don't keep looking for small pivots. Can turn infeasible into numerical error
chris-maes
committed

Commits on Jun 18, 2025

First stab at hypersparse B and B^T solve
chris-maes
committed

Commits on Jun 26, 2025

Hypersparsity with MPF update
chris-maes
committed

Commits on Jun 27, 2025

Dynamically switch between sparse and hypersparse solves. 1.42X improvement on NETLIB
chris-maes
committed

Commits on Jul 7, 2025

Maintain and update a list of primal infeasibilites and more
chris-maes
committed

Commits on Jul 17, 2025

Merge branch 'branch-25.08' into hypersparsity
rgsl888prabhu
authored

Commits on Jul 22, 2025

Fix incorrect infeasibility classification of maros. Helps greenbea and greenbeb as well. Farkas works on 17/24 NETLIB infeasible problems
chris-maes
committed

Commits on Jul 23, 2025

Commits on Jul 28, 2025

Drop small elements. Dont copy intermediate solutions if not needed
chris-maes
committed

Commits on Jul 29, 2025

Commits on Jul 31, 2025