Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.07310 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911269251973120 |
|---|---|
| author | Marousi, Asimina Charitopoulos, Vassilis M. |
| author_facet | Marousi, Asimina Charitopoulos, Vassilis M. |
| contents | This paper presents a novel algorithm integrating global and robust optimization methods to solve continuous non-convex quadratic problems under convex uncertainty sets. The proposed Robust spatial branch-and-bound (RsBB) algorithm combines the principles of spatial branch-and-bound (sBB) with robust cutting planes. We apply the RsBB algorithm to quadratically constrained quadratic programming (QCQP) problems, utilizing McCormick envelopes to obtain convex lower bounds. The performance of the RsBB algorithm is compared with stateof-the-art methods that rely on global solvers. As computational test bed for our proposed approach we focus on pooling problems under different types and sizes of uncertainty sets. The findings of our work highlight the efficiency of the RsBB algorithm in terms of computational time and optimality convergence and provide insights to the advantages of combining robustness and optimality search. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_07310 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Global and Robust Optimization for Non-Convex Quadratic Programs Marousi, Asimina Charitopoulos, Vassilis M. Optimization and Control This paper presents a novel algorithm integrating global and robust optimization methods to solve continuous non-convex quadratic problems under convex uncertainty sets. The proposed Robust spatial branch-and-bound (RsBB) algorithm combines the principles of spatial branch-and-bound (sBB) with robust cutting planes. We apply the RsBB algorithm to quadratically constrained quadratic programming (QCQP) problems, utilizing McCormick envelopes to obtain convex lower bounds. The performance of the RsBB algorithm is compared with stateof-the-art methods that rely on global solvers. As computational test bed for our proposed approach we focus on pooling problems under different types and sizes of uncertainty sets. The findings of our work highlight the efficiency of the RsBB algorithm in terms of computational time and optimality convergence and provide insights to the advantages of combining robustness and optimality search. |
| title | Global and Robust Optimization for Non-Convex Quadratic Programs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2503.07310 |