Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization. |
| Συγγραφείς: |
Lapucci, Matteo, Liuzzi, Giampaolo, Lucidi, Stefano, Mansueto, Pierluigi |
| Πηγή: |
Journal of Global Optimization; Feb2026, Vol. 94 Issue 2, p517-538, 22p |
| Θεματικοί όροι: |
Constrained optimization, Optimization algorithms, Nonsmooth optimization, Mathematical optimization, Mixed integer linear programming |
| Περίληψη: |
In this paper we consider bound-constrained mixed-integer optimization problems where the objective function is differentiable w.r.t. the continuous variables for every configuration of the integer variables. We mainly suggest to exploit derivative information when possible in these scenarios: concretely, we propose an algorithmic framework that carries out local optimization steps, alternating searches along gradient-based and primitive directions. The algorithm is shown to match the convergence properties of a derivative-free counterpart. Most importantly, the results of thorough computational experiments show that the proposed method clearly outperforms not only the derivative-free approach but also the main alternatives available from the literature to be used in the considered setting, both in terms of efficiency and effectiveness. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Global Optimization is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Complementary Index |