Pith sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2607.03627 v1 pith:TAOPHMTG submitted 2026-07-03 math.OC

Rapid Concurrent GPU-CPU Solvers for Scalable Unit Commitment in Large Power Grids

classification math.OC
keywords concurrentsolversolversacceleratedapproachcommitmentgpu-cpuminutes
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper presents an accelerated solver for the unit commitment problem in large-scale power systems. The approach is based on the concurrent execution of GPU- and CPU-based optimization solvers on a single machine, with the solver that converges first terminating the other to minimize overall runtime. This strategy effectively harnesses the complementary strengths of different solvers. Convergence is further accelerated through a systematic and aggressive presolve approach. Numerical experiments on a 6,049-bus system with millions of decision variables and constraints demonstrate speedups ranging from 2.14x to 5.61x, reducing the maximum runtime from 42.12 minutes to 5.77 minutes across 45 test cases. These results highlight the scalability and computational efficiency of the proposed GPU-CPU concurrent solver framework.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.