Author: 5Lab

This talk was canceled because of the emersion of the coronavirus in Japan

• Date: 28th of February, 10:30-11:30
• Place: Engineering 14th Building, room 534 (5th floor)
• Presenter: Scott Lindstrom (Hong Kong Polytechnic University)

Error Bounds for the Exposed Faces of the Exponential Cone

Abstract: Exponential cone programming has recently been introduced in Mosek.
We show that the exposed faces of the exponential cone satisfy a generalised regularity condition, and we explain how this condition affords a reasonable error bound.
The analysis relies upon properties of the Lambert W function.

Day: 24th of September (Tuesday)
Room: Engineering 14th Building, room 522 (5th floor).

Schedule

9:30 ~ 10:10:  Jan Harold Alcantara (NTNU)

“Smoothed neural networks for nonlinear complementarity problems”

10:15 ~ 10:55: Thanh Chieu (NTNU)

“Smoothing Approach for A Certain Type of Bilevel Nonsmooth Optimization”

11:00 ~ 11:40: Jein-Shan Chen (NTNU)

“Constructions of new complementarity functions for NCP and SOCCP” [slide]

 

11:50~13:10: Lunch

 

13:20 ~ 14:00: Mirai Tanaka (ISM)

“An adaptive LP-Newton method for second-order cone optimization”

14:05 ~ 14:45: Michael Metel (RIKEN-AIP)

“Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization”

15:00 ~ 15:40: Yasushi Narushima (Keio University)

“Robust Supply Chain Network Equilibrium Models”

15:45 ~ 16:25: Masaru Ito (Nihon University)

“An adaptive proximal-point approach for first-order methods”

16:30 ~ 17:10: Tianxiang-Liu (RIKEN-AIP)

“A successive difference-of-convex approximation method with applications to control problems”

There was a change in this schedule.

——————————————————————————

Date:  30th May (Thu) 13:00-14:00
Place:  534, Engineering Bldg.14
Speaker:  Jean-Philippe Chancelier

Title:  Decomposition/Coordination Methods in Multistage Stochastic Optimization

——————————————————————————

Date:  30th May (Thu) 14:00-15:00
Place:  534, Engineering Bldg.14
Speaker:  Michel De Lara

Title:  Hidden Convexity in the l0 Pseudonorm and Lower Bound Convex Programs for Exact Sparse Optimization