Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2507.02120 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916824087527424 |
|---|---|
| author | Bertsimas, Dimitris Hertog, Dick den Koukouvinos, Thodoris |
| author_facet | Bertsimas, Dimitris Hertog, Dick den Koukouvinos, Thodoris |
| contents | Polynomial optimization problems represent a wide class of optimization problems, with a large number of real-world applications. Current approaches for polynomial optimization, such as the sum of squares (SOS) method, rely on large-scale semidefinite programs, and therefore the scale of problems to which they can be applied is limited and an optimality guarantee is not always provided. Moreover, the problem can have other convex nonlinear parts, that cannot be handled by these approaches. In this paper, we propose an alternative approach for polynomial optimization. We obtain a convex relaxation of the original polynomial optimization problem, by deriving a sum of linear times convex (SLC) functions decomposition for the polynomial. We prove that such SLC decompositions always exist for arbitrary degree polynomials. Moreover, we derive the SLC decomposition that results in the tightest lower bound, thus improving significantly the quality of the obtained bounds in each node of the spatial Branch and Bound method. In the numerical experiments, we show that our approach outperforms state-of-the-art methods for polynomial optimization, such as BARON and SOS. We show that with our method, we can solve polynomial optimization problems to optimality with 40 variables and degree 3, as well as 20 variables and degree 4, in less than an hour. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02120 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A novel exact approach to polynomial optimization Bertsimas, Dimitris Hertog, Dick den Koukouvinos, Thodoris Optimization and Control Polynomial optimization problems represent a wide class of optimization problems, with a large number of real-world applications. Current approaches for polynomial optimization, such as the sum of squares (SOS) method, rely on large-scale semidefinite programs, and therefore the scale of problems to which they can be applied is limited and an optimality guarantee is not always provided. Moreover, the problem can have other convex nonlinear parts, that cannot be handled by these approaches. In this paper, we propose an alternative approach for polynomial optimization. We obtain a convex relaxation of the original polynomial optimization problem, by deriving a sum of linear times convex (SLC) functions decomposition for the polynomial. We prove that such SLC decompositions always exist for arbitrary degree polynomials. Moreover, we derive the SLC decomposition that results in the tightest lower bound, thus improving significantly the quality of the obtained bounds in each node of the spatial Branch and Bound method. In the numerical experiments, we show that our approach outperforms state-of-the-art methods for polynomial optimization, such as BARON and SOS. We show that with our method, we can solve polynomial optimization problems to optimality with 40 variables and degree 3, as well as 20 variables and degree 4, in less than an hour. |
| title | A novel exact approach to polynomial optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.02120 |