Papers › PDLP: A Practical First-Order Method for Large-Scale Linear Programming

PDLP: A Practical First-Order Method for Large-Scale Linear Programming

13 Jan 2025arXiv:2501.07018links table onlyarchive 2025-07-28

David Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, Warren Schudy

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present PDLP, a practical first-order method for linear programming (LP) designed to solve large-scale LP problems. PDLP is based on the primal-dual hybrid gradient (PDHG) method applied to the minimax formulation of LP. PDLP incorporates several enhancements to PDHG, including diagonal preconditioning, presolving, adaptive step sizes, adaptive restarting, and feasibility polishing. Our algorithm is implemented in C++, available in Google's open-source OR-Tools library, and supports multithreading. To evaluate our method, we introduce a new collection of eleven large-scale LP problems with sizes ranging from 125 million to 6.3 billion nonzeros. PDLP solves eight of these instances to optimality gaps of 1% (with primal and dual feasibility errors of less than 10⁻⁸) within six days on a single machine. We also compare PDLP with Gurobi barrier, primal simplex, and dual simplex implementations. These traditional methods are designed to solve linear programs to much tighter optimality gaps but struggle to solve these instances. Gurobi barrier solves only three instances, exceeding our 1TB RAM limit on the other eight. While primal and dual simplex are more memory-efficient than the barrier method, they are slower and solve only three instances within six days. Compared with the conference version of this work (in: Advances in Neural Information Processing Systems 34 (NeurIPS 2021)), the key new contributions are: (i) feasibility polishing, a technique that quickly finds solutions that are approximately optimal but almost exactly feasible (without which only two of the eleven problems can be solved); (ii) a multithreaded C++ implementation available in Google OR-Tools; and (iii) a new collection of large-scale LP problems. Note that the conference version should be referred to for comparisons with SCS and ablation studies, which we do not repeat in this paper.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

The archive's official repository (google-research/FirstOrderLp.jl) was not harvested; the 9 samples below come from 2 repositories the archive does not mark official.

Syntology 9 code samples harvested from 2 repositories linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: found in paper text by Syntology: 6 samples from 1 repository, 5 ran (5 with no instrument failure; 0 where Syntology's instrument failed); community: 3 samples from 1 repository, 2 ran (0 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-24 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 7 samples that ran have no recorded date.

google-research/FirstOrderLp.jl officialmentioned in paperApache-2.0Syntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
1ran; the contract check could not run
5ran
2unverified

Licence: 3 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

google/or-tools found in paper text by Syntology 6 samples, 5 ran (0 instrument-failed) · 1 unverified
deprecated_method ortools/sat/python/cp_model.py ran Apache-2.0 (permissive) · b064029eab8b1791 · report fixture: signature func:callable/0/?, old_name:str/0/str · returned function · level recorded 2026-09-25
is_a_number ortools/linear_solver/python/model_builder_numbers.py ran fingerprinted Apache-2.0 (permissive) · a178873f45801076 · report fixture: signature x:int/0/int · returned bool · level recorded 2026-09-24
is_integral ortools/linear_solver/python/model_builder_numbers.py ran fingerprinted Apache-2.0 (permissive) · 91a1c170660ea3f6 · report fixture: signature x:int/0/int · returned bool · level recorded 2026-09-24
is_zero ortools/linear_solver/python/model_builder_numbers.py ran fingerprinted Apache-2.0 (permissive) · ae9dc9e14f1c761b · report fixture: signature x:int/0/int · returned bool · level recorded 2026-09-24
snake_case_to_camel_case ortools/sat/python/cp_model.py ran fingerprinted Apache-2.0 (permissive) · 3d245e14dadd311d · report fixture: signature name:str/0/str · returned str · level recorded 2026-09-25
deprecated in 25 papers ortools/sat/python/cp_model.py unverified Apache-2.0 (permissive) · fdadc7e6c0d5856d · report
mmaaz-git/pdlp community 3 samples, 2 ran (2 instrument-failed) · 1 unverified
decompress_mps benchmarks/mittelmann.py ran · our draft was wrong fingerprinted no licence file found · pointer only · a6e67078a082f0df · report fixture: signature compressed_file:str/0/str · returned str · level recorded, date not recorded
solve in 25 papers pdlp.py ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only · d4ec6c6df72cb4b0 · report fixture: signature c:Tensor/1/float, G:Tensor/2/float, h:Tensor/1/float, A:Tensor/2/float, b:Tensor/1/float, l:Tensor/1/float, u:Tensor/1/float, iteration_limit:int/0/int, time_sec_limit:float/0/float, primal_weight_update_smoothing:float/0/float, ruiz_iterations:int/0/int, pock_chambolle_alpha:float/0/float, eps_tol:float/0/float, eps_primal_infeasible:float/0/float, eps_dual_infeasible:float/0/float, verbose:bool/0/bool · returned tuple · level recorded, date not recorded
download_mps benchmarks/mittelmann.py unverified no licence file found · pointer only · 03edfcca135ae5df · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections