Scribd
Upload
24 views1 page

X 1

This paper confirms the utility of GPUs in solving linear programming by presenting cuPDLP.jl, a GPU implementation of the restarted primal-dual hybrid gradient method. The implementation shows comparable performance to Gurobi, a well-established LP solver. This work highlights the potential of GPUs and first-order methods in achieving competitive performance in linear programming tasks.

Uploaded by

Qingshu Chang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

X 1

This paper confirms the utility of GPUs in solving linear programming by presenting cuPDLP.jl, a GPU implementation of the restarted primal-dual hybrid gradient method. The implementation shows comparable performance to Gurobi, a well-established LP solver. This work highlights the potential of GPUs and first-order methods in achieving competitive performance in linear programming tasks.

Uploaded by

Qingshu Chang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

In this paper, we provide an affirmative answer to the long-standing question: Are GPUs

useful

in solving linear programming? We present cuPDLP.jl, a GPU implementation of restarted

primal-dual hybrid gradient (PDHG) for solving linear programming (LP). We show that

this

prototype implementation in Julia has comparable numerical performance on standard LP

benchmark sets to Gurobi, a highly optimized implementation of the simplex and interior-

point

methods. This demonstrates the power of using GPUs in linear programming, which, for

the

first time, showcases that GPUs and first-order methods can lead to performance

comparable

You might also like