Workshop on Advances in Optimization

August 12-13 2016
TKP Shinagawa Conference Center, Tokyo, Japan.


Program

Please click here for a detailed program.

The workshop will be held in TKP Shinagawa Conference Center, room 4E (4th floor), Tokyo, Japan.
Please click here for the access information.


Friday, August 12
09h30 - 10h00 Reception/Coffee/Opening remarks
10h00 - 12h00 Session A1
A11On the worst-case complexity of the gradient method with exact line search for strongly convex functions with Lipschitz gradients
Etienne de Klerk (Tilburg University)
A12Sharpe ratio optimization
Michael Metel (Université de Paris Sud)
A13Sergei Chubanov (University of Siegen)
A14Polynomial Time Iterative Methods for Integer Programming
Shmuel Onn (Technion)
12h00 - 13h30 Lunch
13h30 - 15h30 Session A2
A21Ellipsoid method vs accelerated gradient descent
Yin Tat Lee (Microsoft)
A22On the exact convergence rates of gradient methods for smooth (strongly) convex optimization
François Glineur (Université catholique de Louvain)
A23Mixed-integer SOCP in optimal contribution selection of tree breeding
Makoto Yamashita (Tokyo Institute of Technology)
A24Squared slack variables in nonlinear symmetric cone programming: Optimality conditions and augmented Lagrangians
Bruno Figueira Lourenço (Seikei University)
15h30 - 16h00 Coffee
16h00 - 18h00 Session A3
A31An improved two-stage optimization-based framework for unequal-areas facility layout
Miguel Anjos (Polytechnique Montréal)
A32Full-, twin- and Lagrangian-DNN relaxations for binary quadratic optimization Problems
Masakazu Kojima (Chuo University)
A33On semismooth Newton based augmented Lagrangian method for lasso-type problems
Kim Chuan Toh (National University of Singapore)
A34The simplex method for degenerate and nondegenerate linear programming problems
Shinji Mizuno (Tokyo Institute of Technology)


Saturday, August 13
09h30 - 10h00 Reception/Coffee
10h00 - 12h00 Session B1
B11Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
Gabor Pataki (University of North Carolina at Chapel Hill)
B12Disjunctive conic cuts for hyperboloids and non-convex quadratic cones
Julio Góez (Norwegian School of Economics)
B13Analysis on conic programing via facial reduction
Masakazu Muramatsu (University of Electro-communications)
B14A second-order cone based approach for solving the trust region subproblem and its variants
Fatma Kilinc Karzan (Carnegie Mellon University)
12h00 - 13h30 Lunch
13h30 - 15h30 Session B2
B21Centerpoints: A link between optimization and convex geometry
Amitabh Basu (Johns Hopkins University)
B22Feature subset selection for logistic regression via mixed integer optimization
Yuichi Takano (Senshu University)
B23Geometric Median in Nearly Linear Time
Aaron Sidford (Stanford University)
B24Random-edge is slower than random-facet on abstract cubes
Thomas Dueholm Hansen (Aarhus University)
15h30 - 16h00 Coffee
16h00 - 18h00 Session B4
B41Margin and overlap for convex bodies
David Bremner (University of New Brunswick)
B42Implementation of interior-point methods for LP using Krylov subspace methods preconditioned by inner iterations
Keiichi Morikuni (University of Tsukuba)
B43A comparative study of steepest descent methods for strongly convex quadratic functions
Mituhiro Fukuda (Tokyo Institute of Technology)
B44Linear optimization: Algorithms and conjectures
Tamás Terlaky (Lehigh University)
18h00 Closing remarks

Last update: September 13, 2016