Scholarlink

<p>We study a general class of nonlinear complementarity problems including the subclass of polynomial ones. As a solution method, we propose an algorithm based on branch-reduce-and-bound paradigm. In contrast to most existing solution methods, our algorithm works under very general conditions. Computational experiments on a number of complementarity problems show the practicability of our solution approach.</p>

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

Monotonic Complementarity Problems

  • 期刊论文

  • 发表日期：

    2026年6月18日

查看全文
  • Xuan Thanh Le,
  • Do Thi Thuy,
  • Tran Van Thang

摘要

We study a general class of nonlinear complementarity problems including the subclass of polynomial ones. As a solution method, we propose an algorithm based on branch-reduce-and-bound paradigm. In contrast to most existing solution methods, our algorithm works under very general conditions. Computational experiments on a number of complementarity problems show the practicability of our solution approach.