Monday, 19 Nov 2012

Tutorial Lectures

09:20am - 09:30am

Registration

09:30am - 10:15am

Moments, positive polynomials and optimization I (PDF1)

Jean Lasserre, LAAS-CNRS, France

10:15am - 10:45am

--- Coffee Break ---

10:45am - 11:30am

Moments, positive polynomials and optimization II (PDF2)
Jean Lasserre, LAAS-CNRS, France

11:30am - 12:15pm

Moments, positive polynomials and optimization III (PDF3)
Jean Lasserre, LAAS-CNRS, France

12:15pm - 01:45pm

--- Lunch ---

01:45pm - 02:30pm

Moments, positive polynomials and optimization IV (PDF4)
Jean Lasserre, LAAS-CNRS, France

02:30pm - 03:15pm

Moments, positive polynomials and optimization V
Jean Lasserre, LAAS-CNRS, France

03:15pm - 03:45pm

--- Coffee Break ---

Tuesday, 20 Nov 2012

09:00am - 09:20am

Registration

09:20am - 09:30am

Opening remarks

09:30am - 10:15am

Towards higher order semidefinite relaxations for max-cut (PDF)
Franz Rendl, University of Klagenfurt, Austria

10:15am - 10:45am

--- Group Photo & Coffee Break ---

10:45am - 11:30am

Semidefinite programming, matrix completion and geometric graph realizations (PDF)
Monique Laurent, Centrum Wiskunde & Informatica and Tilburg University, The Netherlands

11:30am - 12:15pm

Approximating Lp-norm-constrained polynomial optimization problems via the algorithmic theory of convex bodies (PDF)
Anthony Man-Cho So, The Chinese University of Hong Kong, Hong Kong

12:15pm - 01:45pm

--- Lunch ---

01:45pm - 02:30pm

Symmetric extensions of the NT direction (PDF)
Florian Jarre, Heinrich Heine Universität Düsseldorf, Germany

02:30pm - 03:15pm

A rank-corrected procedure for matrix completion with fixed basis coefficients
Defeng Sun, National University of Singapore

03:15pm - 03:45pm

--- Coffee Break ---

03:45pm - 04:30pm

On the polynomial complexity of exact recovery (PDF)
Stephen Vavasis, University of Waterloo, Canada

04:30pm - 05:15pm

Speeding up the spectral bundle method by solving the quadratic semidefinite subproblems with a PSQMR approach (PDF)
Christoph Helmberg, Chemnitz University of Technology, Germany

Wednesday, 21 Nov 2012

09:15am - 09:30am

Registration

09:30am - 10:15am

Inverse polynomial optimization (PDF)
Jean Lasserre, LAAS-CNRS, France

10:15am - 10:45am

--- Coffee Break ---

10:45am - 11:30am

On low rank relaxation and polynomial optimization
Shuzhong Zhang, University of Minnesota, USA

11:30am - 12:15pm

Optimality conditions and finite convergence of Lasserre's hierarchy (PDF)
Jiawang Nie, University of California at San Diego, USA

12:15pm - 01:45pm

--- Lunch ---

01:45pm - 02:30pm

Complexity of tensor problems and its implications in optimization
Lek-Heng Lim, University of Chicago, USA

02:30pm - 03:15pm

A perturbed sums of squares theorem for polynomial optimization and its applications
Hayato Waki, Kyushu University, Japan

03:15pm - 03:45pm

--- Coffee Break ---

03:45pm - 04:30pm

Inverse moment problems on polytopes and optimization (PDF)
Dmitrii Pasechnik, Nanyang Technological University

04:30pm - 05:15pm

Barrier-based smoothing proximal point algorithm for nonlinear complementarity problems over closed convex cones (PDF)
Chek-Beng Chua, Nanyang Technological University

Thursday, 22 Nov 2012

09:15am - 09:30am

Registration

09:30am - 10:15am

Improved lower bounds for book crossing numbers of complete bipartite graphs using semidefinite programming (PDF)
Etienne de Klerk, Nanyang Technological University

10:15am - 10:45am

--- Coffee Break ---

10:45am - 11:30am

Outlier pursuit: robust PCA and collaborative filtering (PDF)
Huan Xu, National University of Singapore

11:30am - 12:15pm

Signal reconstruction from the magnitude of subspace components (PDF)
Christine Bachoc, Université Bordeaux 1, France

12:15pm - 01:45pm

--- Lunch ---

01:45pm - 02:30pm

Solving conic optimization problems with MOSEK (PDF)
Erling Andersen, MOSEK ApS, Denmark

02:30pm - 03:15pm

On optimization over nonsymmetric cones (PDF)
Akiko Yoshise, University of Tsukuba, Japan

03:15pm - 03:45pm

--- Coffee Break ---

03:45pm - 04:30pm

Computing the nearest Euclidean distance matrix with low embedding dimensions
Houduo Qi, University of Southampton, UK

04:30pm - 05:15pm

On the convergence rate of a generalized proximal point algorithm
Xiaoming Yuan, Hong Kong Baptist University, Hong Kong

06:30pm - 09:00pm

Dinner at East Coast Seafood Center (Volunteer and self-paid)

Friday, 23 Nov 2012

09:15am - 09:30am

Registration

09:30am - 10:15am

Computational and sample tradeoffs via convex relaxation
Venkat Chandrasekaran, California Institute of Technology, USA

10:15am - 10:45am

--- Coffee Break ---

10:45am - 11:30am

A first-order framework for solving ellipsoidal inclusion problems (PDF)
Selin Damla Ahipasaoglu, Singapore University of Technology and Design

11:30am - 12:15pm

On the number of solutions generated by the simplex method for LP (PDF)
Shinji Mizuno, Tokyo Institute of Technology, Japan

12:15pm - 01:45pm

--- Lunch ---

01:45pm - 02:30pm

Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (PDF)
Yinyu Ye, Stanford University, USA

02:30pm - 03:15pm

An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP (PDF)
Kim-Chuan Toh, National University of Singapore

03:15pm - 03:45pm

--- Coffee Break ---