Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization

  • 期刊论文

  • 发表日期：

    2026年1月12日

查看全文
  • Matteo Lapucci,
  • Giampaolo Liuzzi,
  • Stefano Lucidi,
  • Pierluigi Mansueto

摘要

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.