Article Dans Une Revue Mathematical Programming Computation Année : 2025

LinA: A faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization

Résumé

In this paper, we address the problem of approximating and over/under-estimating univariate functions with piecewise linear (PWL) functions with the minimum number of linear segments given a bound on the pointwise approximation error allowed. Through a new geometric approach and building on the work of Ngueveu [Ngu19], we develop new algorithms that can solve the problem in quasi-logarithmic time on a very broad class of error types. Such algorithms find many applications, mostly related to solving certain classes of (mixed-integer) nonlinear and nonconvex programming (MINLP) problems by mixed-integer linear programming (MILP) techniques. An efficient implementation of our algorithms is available as a Julia package. Benchmarks are also provided to showcase how our method outperforms the state-of-the-art for this problem. Finally, we show how our algorithms can be used to efficiently solve certain classes of MINLP problems by a case study on multicommodity network design problems with congestion.

Fichier principal
Vignette du fichier
Article_LinA_final.pdf (1.21 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-03336003 , version 1 (06-09-2021)
hal-03336003 , version 2 (17-02-2025)

Licence

Identifiants

Citer

Julien Codsi, Sandra Ulrich Ngueveu, Bernard Gendron. LinA: A faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization. Mathematical Programming Computation, 2025, ⟨10.1007/s12532-024-00274-8⟩. ⟨hal-03336003v2⟩
900 Consultations
2700 Téléchargements

Altmetric

Partager

  • More