最適化問題に対する超高速&安定計算

大規模最適化問題、グラフ探索、機械学習やデジタルツインなどの研究のお話が中心

Graph CREST セミナー

2013年04月20日 01時23分47秒 | Weblog
以下の日程と場所が決まりましたので、お伝えします。

日時:2013年5月25日(土):15時から17時
場所:中央大学後楽園キャンパス6号館3階6301室

1: Laszlo Ladanyi (Software R&D at CPLEX, IBM Research, USA)

Title:
CPLEX remote object for distributed parallel optimization

Abstract:
In version 12.5.0 CPLEX has introduced the concept of remote objects
that greatly ease development of distributed parallel applications of
CPLEX optimizers. Remote objects enable the user to create cplex
environments on remote computers and afterwards treat them just as if
they were local environments. In this talk we will describe remote
objects in detail, demonstrate how to use them, and provide some
computational results on real world examples.


2: Hayato Waki (IMI, Kyushu University)

Title:
A perturbed sums of squares theorem for polynomial optimization and
its applications

Abstract:
We prove a property of positive polynomials on a compact set with a
small perturbation. When applied to a Polynomial Optimization Problem
(POP), the property implies that the optimal value of the
corresponding Semi Definite Programming (SDP) relaxation with
sufficiently large relaxation order is bounded from below by
$(f^*-\epsilon)$ and from above by $f^*+\epsilon(n+1)$, where $f^*$ is
the optimal value of the POP. We propose new SDP relaxations for POP
based on modifications of existing sums-of-squares representation
theorems. An advantage of our SDP relaxations is that they are of
considerably smaller dimension than those originally proposed by
Lasserre. We present some applications and the results of our
computational experiments. This is the joint work with Masakazu
Muramatsu and Levent Tuncel.
コメント
  • Twitterでシェアする
  • Facebookでシェアする
  • はてなブックマークに追加する
  • LINEでシェアする