Japanese page

RIMS workshop
The advances and applications of optimization method


Date:July 21-22, 2011
Venue:Room 111, Research Institute for Mathematical Science (RIMS), Kyoto University (access)
ContactShunji UMETANI (Graduate School of Information Science and Technology, Osaka University)
e-mail: umetaniist.osaka-u.ac.jp
tel/fax: +81-6-6879-7799

Scientific Program

Thursday, July 21, 2011
Time Title and speakers
9h30-9h55 Y.Ito, H.Takahashi and *S.Hayashi(Kyoto University)
Robust wardrop equilibrium problems and its reformulation as a second-order cone complementarity problem
9h55-10h20 *T.Okuno(Kyoto University), S.Hayashi and M.Fukushima
Derivation of the KKT conditions for semi-infinite programs with an infinite number of conic constraints
10h20-10h45 *K.Yasuda(Kyoto University) and S.Hayashi
A solution of quadratic fractional programming problems by using duality for nonconvex quadratic programming problem
10h45-11h00 break
11h00-11h25 *M.Muramatsu(The University of Electro-Communications)
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization and their reason
11h25-11h50 *Y.Takano(Tokyo Institute of Technology) and R.Sotirov
A polynomial optimization approach to constant rebalanced portfolio selection
11h50-12h15 *M.Kono(Kyoto University) and M.Fukushima
A method for portfolio optimization with fixed transaction costs
12h15-13h45 lunch break
13h45-14h10 *T.Masaki(University of Tsukuba) and Takahito Kuno
Faster algorithms for computer vision problems
14h10-14h35 *Z.Lishun(Tokyo Institute of Technology) and S.Mizuno
On the separation in 2-period double round robin tournaments with minimum breaks
14h35-15h00 *A.Kira(Kyushu University) and H.Iwane
A local improvement approach to the priority joinable vehicle routing problem
15h00-15h20 *M.Wakamatsu(Chuo University) and T.Matsui
Optimal piano fingering based on inverse optimization
15h20-15h35 break
15h35-16h00 *H.Iwane(Fujitsu Laboratories LTD.), H.Anai and A.Kira
A symbolic approach to parametric polynomial optimization
16h00-16h25 *T.Kosaki
A primal-dual interior-point method for transportation problems
16h25-16h50 *T.Kitahara(Tokyo Institute of Technology) and S.Mizuno
A bound for the number of basic feasible solutions generated by the dual simplex method

Friday, July 22, 2011
Time Title and speakers
9h30-9h55 *S.Takahashi(University of Tsukuba), H.Miyagawa, M.Shigeno and M.Zhang
Community extraction in hypergraphs based on adjacent numbers
9h55-10h20 *R.Takehara(University of Tsukuba) and M.Shigeno
A study of information diffusion games on networks
10h20-10h45 *K.Beppu(Kyoto University) and H.Nagamochi
An appication of multi-sphere scheme to robot path planning
10h45-11h00 break
11h00-11h25 *S.Kadomoto(Kyoto University) and N.Yamashita
A proximal gradient method for large-scale convex optimizations with the L1 regularization and the unit constraint
11h25-11h50 *Y.Narushima(Fukushima National College of Technology) and H.Yabe
Nonlinear conjugate gradient methods based on secant conditions that guarantee descent conditions for unconstrained optimization
11h50-12h15 *H.Sato(Kyoto University) and T.Iwai
Optimization algorithms on the Grassmann manifold
12h15-13h45 lunch break
13h45-14h10 *T.Ishihama(University of Tsukuba) and T.Kuno
On subdivision strategy in the conical algorithm for concave minimization
14h10-14h35 *M.Tanaka(Tokyo Institute of Technology), K.Nakata and H.Waki
A facial reduction and an efficient algorithm for doubly nonnegative relaxation of mixed binary nonconvex quadratic optimization problems
14h35-15h00 *B.T.Ong(Kyoto University) and M.Fukushima
Differential evolution combined with automatic termination
15h00-15h15 break
15h15-15h40 *N.Sukegawa(University of Tsukuba), Y.Yamamoto and L.Zhang
Lagragian relaxation and pegging test for linear ordering problems
15h40-16h05 *Y.Ogiso(Nagoya University), S.Imahori and M.Yagiura
The generalized assignment problem with complex cardinality constraints
16h05-16h30 *Y.Tanaka(Nagoya University), S.Imahori and M.Yagiura
A Lagrangian heuristic for the node capacitated in-tree packing problem