Metraipolis › archive › dc_dce980a45319

ExaModels.jl: an Algebraic Modeling System for Nonlinear Programming on GPUs — arXiv:2608.16265

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.16265
License (as archived)
CC0-1.0
Archived
2026-10-18T20:19:00.288Z
SHA-256 of the archived text
a8437e5f8153a9973bc7b3fd96e02edf70d4f5cfca3491536af816a7ef6a2864
Stable URL of this page
https://metraipolis.com/documento/dc_dce980a45319

How to cite

ExaModels.jl: an Algebraic Modeling System for Nonlinear Programming on GPUs — arXiv:2608.16265 — arXiv (en), https://arxiv.org/abs/2608.16265 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dce980a45319 (Metraipolis archive dc_dce980a45319, sha256 a8437e5f8153a9973bc7b3fd96e02edf70d4f5cfca3491536af816a7ef6a2864)
BibTeX
@misc{dcdce980a45319,
  title = {ExaModels.jl: an Algebraic Modeling System for Nonlinear Programming on GPUs — arXiv:2608.16265},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.16265},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dce980a45319; sha256 a8437e5f8153a9973bc7b3fd96e02edf70d4f5cfca3491536af816a7ef6a2864},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16265. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Large-scale nonlinear programs almost always exhibit partially separable and repetitive structure, yet most existing algebraic modeling systems do not take advantage of it. A nonlinear optimization solver queries the objective, the constraints, and their derivatives at every iteration, so the speed of these evaluations bears directly on the overall solution time. We present this http URL , a Julia-based algebraic modeling system that exploits this structure to evaluate the objective, the constraints, and their derivatives in parallel. At its core is a single-instruction, multiple-data abstraction that represents a nonlinear program as a small number of algebraic patterns, each repeated over many data points. Because the patterns are visible at compile time, a specialized model and derivative evaluation kernel is compiled for each pattern. Applying that kernel independently across the data points maps naturally onto GPU parallelism and, with sufficiently many threads, yields O(1) evaluation time regardless of the number of data points. On the largest instances of the Luksan-Vlcek library, GPU execution speeds up sparse Hessian evaluation by 76x over single-threaded CPU evaluation, and by 30x on COPS and 7.3x on PGLIB-OPF.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.16265 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T19:45:07.851Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).