Dr. Felipe Serrano (Zuse Institute Berlin)

Maximal Quadratic-Free Sets

The intersection cut paradigm is a powerful framework that facilitates the generation of valid linear inequalities, or cutting planes, for a potentially complex feasible set S of an optimization problem. The key ingredient in this construction is an S-free set: a convex zone whose interior does not intersect S. Ideally, such S-free set would be inclusion-wise maximal, as it would generate a deeper cutting plane. In the case of integer programming, maximal lattice-free sets (i.e., when S corresponds to the integer lattice) have proven to be a powerful tool and have been carefully studied by the optimization community. In this talk, we consider quadratically constrained optimization problems and show how to construct maximal S-free sets when S is defined as a general quadratic inequality. Our maximal S-free sets are such that efficient separation of a vertex in LP-based approaches to quadratically constrained problems is guaranteed. We will also discuss some implementation details.

無料

[Web開催]

• 2020年11月18日 (水) 18:00～19:00 受付終了

日時の欄にある[申し込む]をクリックするか、こちらのセミナースケジュールのページで参加を希望されるセミナーをクリックし、表示されるフォームよりお申し込みください。
折り返し、E-mail にて受講票を送付します。

フォームがご利用いただけない場合は、お手数ですが、下記までお問合せください。なお、お問合せ時間は平日 10:00 ～ 16:00 （電子メール、フォームは随時）となっております。

（株）NTT データ数理システム《Numerical Optimizer》担当
〈nuopt-info@msi.co.jp〉
電話 03-3358-6681