講演者： 久野 誉人 氏 （筑波大学 電子・情報工学系）
タイトル：
On convergence of the Simplicial Algorithm
with a Class of Subdivision Strategies
概要：
The simplicial algorithm is a kind of
branch-and-bound method for computing a globally
optimal solution of a convex maximization problem.
Its convergence under the omega-subdivision
branching strategy was an open problem for years
until Locatelli and Raber proved it in 2000.
In this talk, we modify the linear programming
relaxation and give a different and simpler proof
of the convergence.
