Concurrent Crossover for PDHG
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918175749177344 |
|---|---|
| author | Rothberg, Edward |
| author_facet | Rothberg, Edward |
| contents | First-order methods based on the PDHG algorithm have recently emerged as a viable option for efficiently solving large-scale linear programming problems. One highly desirable property of these methods is that they can make effective use of GPUs. One undesirable property is that, as first-order methods, their convergence can be extremely slow. This property forces one to decide how much accuracy is truly necessary when solving an LP problem. This paper looks at whether a parallel, concurrent crossover scheme can help to obtain highly accurate solutions without sacrificing the benefits of these new approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24429 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Concurrent Crossover for PDHG Rothberg, Edward Optimization and Control First-order methods based on the PDHG algorithm have recently emerged as a viable option for efficiently solving large-scale linear programming problems. One highly desirable property of these methods is that they can make effective use of GPUs. One undesirable property is that, as first-order methods, their convergence can be extremely slow. This property forces one to decide how much accuracy is truly necessary when solving an LP problem. This paper looks at whether a parallel, concurrent crossover scheme can help to obtain highly accurate solutions without sacrificing the benefits of these new approaches. |
| title | Concurrent Crossover for PDHG |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.24429 |