Wed.3 16:00–17:15

16:00
16:25
16:50
H 2053 | APP Applications in Finance and Real Options
Daniel Ralph
Peter Schütz
Luis Zuluaga
16:00 Daniel Ralph

“POST”, a robust method for Real-Option Valuation in Multiple Dimensions Using Poisson Optional Stopping Times

16:25 Peter Schütz

Optimal hedging strategies for salmon producers

16:50 Luis Zuluaga

Computing near-optimal Value-at-Risk portfolios using integer programming techniques

H 0104 | BIG Recent Advancements in Optimization Methods for Machine Learning (4/4)
Martin Jaggi
Robert Gower
Ahmet Alacaoglu
16:00 Martin Jaggi

Decentralized Learning with Communication Compression

16:25 Robert Gower

Expected smoothness is the key to understanding the mini-batch complexity of stochastic gradient methods

16:50 Ahmet Alacaoglu

Almost surely constrained convex optimization

H 0110 | BIG Recent Advances in Convex and Non-Convex Optimization and Their Applications in Machine Learning (2/2)
Yuejie Chi
Praneeth Netrapalli
Raef Bassily
16:00 Yuejie Chi

Implicit Regularization in Nonconvex Low-Rank Matrix Completion

16:25 Praneeth Netrapalli

Nonconvex-Nonconcave Minmax Optimization: Stable Limit Points of Gradient Descent Ascent are Locally Optimal

16:50 Raef Bassily

On the Effectiveness of SGD in Modern Over-parameterized Machine Learning

H 3002 | BIG Recent Advances in Distributed Optimization
Alex Olshevsky
Alexander Gasnikov
Jingzhao Zhang
16:00 Alex Olshevsky

Asymptotic Network Independence for Stochastic Gradient Descent

16:25 Alexander Gasnikov

On the Complexity of Approximating Wasserstein Barycenters

16:50 Jingzhao Zhang

Direct Runge-Kutta discretization achieves acceleration

H 1058 | VIS Complementarity: Extending Modeling and Solution Techniques (1/2)
Olivier Huber
Youngdae Kim
Michael Ferris
16:00 Olivier Huber

On Solving Models with Optimal Value Function

16:25 Youngdae Kim

SELKIE: a model transformation and distributed solver for structured equilibrium problems

16:50 Michael Ferris

Capacity expansion and operations tradeoffs in renewable electricity

H 0111 | CON Theoretical Aspects of Conic Optimization
Naomi Shaked-Monderer
Takashi Tsuchiya
Roland Hildebrand
16:00 Naomi Shaked-Monderer

On the generalized inverse of a copositive matrix

16:25 Takashi Tsuchiya

Duality theory of SDP revisited: most primal-dual weakly feasible SDPs have finite nonzero duality gaps

16:50 Roland Hildebrand

Towards optimal barriers for convex cones

H 2032 | CON Conic Optimization and Machine Learning
Pablo Parrilo [cancelled]
Pravesh Kothari
Amir Ali Ahmadi
16:00 Pablo Parrilo [cancelled]

TBA

16:25 Pravesh Kothari

Average-Case Algorithm Design Using Sum-of-Squares

16:50 Amir Ali Ahmadi

Learning Dynamical Systems with Side Information

H 1028 | CNV New Frontiers in Splitting Algorithms for Optimization and Monotone Inclusions (3/3)
Nimit Nimana
Dang-Khoa Nguyen
Marcel Jacobse
16:00 Nimit Nimana

Generalized forward-backward splitting with penalty terms for monotone inclusion problems

16:25 Dang-Khoa Nguyen

A proximal minimization algorithm for structured nonconvex and nonsmooth problems

16:50 Marcel Jacobse

Examining failure of a Mehrotra predictor-corrector method on minimal examples

H 3025 | CNV Algorithms for Large-Scale Convex and Nonsmooth Optimization (2/2)
Masoud Ahookhosh
Avinash Dixit
Ewa Bednarczuk
16:00 Masoud Ahookhosh

A superlinearly convergent Bregman forward-backward method for nonsmooth nonconvex optimization

16:25 Avinash Dixit

A new accelerated algorithm to solve convex optimization problems

16:50 Ewa Bednarczuk

[moved] On Lipschitzness of projections onto convex sets given by systems of nonlinear inequalities and equations under relaxed constant rank condition

H 2033 | DER Derivative-Free Optimization Under Uncertainty (2/2)
Fani Boukouvala
Friedrich Menhorn
Morteza Kimiaei
16:00 Fani Boukouvala

Data-driven branch-and-bound algorithms for derivative-free optimization

16:25 Friedrich Menhorn

Near-optimal noise control in derivative-free stochastic optimization

16:50 Morteza Kimiaei

Efficient noisy black box optimization

H 3008 | GLO Generalized Distances and Envelope Functions
Scott B. Lindstrom
Andreas Themelis
Ting Kei Pong
16:00 Scott B. Lindstrom

The Fitzpatrick Distance

16:25 Andreas Themelis

A universal majorization-minimization framework for the convergence analysis of nonconvex proximal algorithms

16:50 Ting Kei Pong

Polar envelope and polar proximal map

H 0105 | NON Geometry and Optimization
Florentin Goyens
Erlend Skaldehaug Riis
Mario Lezcano Casado
16:00 Florentin Goyens

Nonlinear matrix recovery

16:25 Erlend Skaldehaug Riis

A geometric integration approach to nonsmooth, nonconvex optimisation

16:50 Mario Lezcano Casado

Optimization in compact matrix Lie groups, with applications to machine learning

H 1012 | NON Developments in Structured Nonconvex Optimization (2/2)
Nikitas Rontsis
André Uschmajew
Tianxiang Liu
16:00 Nikitas Rontsis

An eigenvalue based active-set solver for norm-constrained quadratic problems, with applications to extended trust region subproblems and sparse PCA

16:25 André Uschmajew

A Riemannian optimization approach to sparse low-rank recovery

16:50 Tianxiang Liu

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

H 1029 | NON Advances in Nonlinear Optimization Algorithms (2/2)
Erik Berglund
Wenwen Zhou
Hao Wang
16:00 Erik Berglund

An Eigenvalue Based Limited Memory BFGS Method

16:25 Wenwen Zhou

A modified projected gradient method for bound constrained optimization problems

16:50 Hao Wang

An inexact first-order method for constrained nonlinear optimization

H 2013 | NON New Trends in Optimization Methods and Machine Learning (3/3)
Saeed Ghadimi
Hien Le
16:00 Saeed Ghadimi

Zeroth-order Nonconvex Stochastic Optimization: Handling Constraints, High-Dimensionality, and Saddle-Points

16:25 Hien Le

Inertial Block Mirror Descent Method for Non-convex Non-smooth Optimization

16:50

H 3007 | NON Recent Trends in Large Scale Nonlinear Optimization (2/2)
Filippo Pecci
Michal Kočvara
Man Shun Ang
16:00 Filippo Pecci

Non-linear inverse problems via sequential convex optimization

16:25 Michal Kočvara

On Newton-type multilevel optimization methods

16:50 Man Shun Ang

Accelerating Nonnegative-X by extrapolation, where X \ensuremath{\in} {Least Square, Matrix Factorization, Tensor Factorization}

H 0106 | PDE Optimal Control of Nonsmooth Systems (3/3)
Gerd Wachsmuth
Anne-Therese Rauls
Georg Müller
16:00 Gerd Wachsmuth

Second-order conditions for optimal control of the obstacle problem

16:25 Anne-Therese Rauls

Subgradient Calculus for the Obstacle Problem

16:50 Georg Müller

Multiobjective Optimal Control of a Non-Smooth Semi-Linear Elliptic PDE

H 0107 | PDE Optimal Control and Dynamical Systems (7/7)
Emilio Vilches
Cristopher Hermosilla
Fernando Lobo Pereira
16:00 Emilio Vilches

Some results on the optimal control of implicit sweeping processes

16:25 Cristopher Hermosilla

Hamilton-Jacobi-Bellman approach for optimal control problems of sweeping processes

16:50 Fernando Lobo Pereira

A Predictive Control Framework for the Sustainable Management of Resources

H 0112 | PDE Decomposition-Based Methods for Optimization of Time-Dependent Problems (2/2)
Nicolas Gauger
Alexander Engelmann
Carl Laird
16:00 Nicolas Gauger

Layer-parallel training of deep residual neural networks

16:25 Alexander Engelmann

Decomposition of optimal control problems using bi-level distributed ALADIN

16:50 Carl Laird

Schur-complement and ADMM approaches for Time-Domain Decomposition in Optimization with PyNumero

H 3004 | ROB Robust Nonlinear Optimization
Oleg Kelis
Jianzhe (Trevor) Zhen
Frans de Ruiter
16:00 Oleg Kelis

Finite-horizon singular \ensuremath{H_\infty} control problem: a regularization method

16:25 Jianzhe (Trevor) Zhen

Distributionally Robust Nonlinear Optimization

16:50 Frans de Ruiter

Effective approach for hard uncertain convex inequalities

H 3006 | ROB Algorithms and Applications of Robust Optimization
Napat Rujeerapaiboon
Wolfram Wiesemann
William Haskell
16:00 Napat Rujeerapaiboon

Robust Multidimensional Pricing: Separation without Regret

16:25 Wolfram Wiesemann

Data-Driven Chance Constrained Programs over Wasserstein Balls

16:50 William Haskell

An Inexact Primal-Dual Smoothing Framework with Applications to Robust Optimization

H 2038 | SPA Block Alternating Schemes for Nonsmooth Optimization at a Large Scale
Krzysztof Rutkowski
Marco Prato
Jean-Christophe Pesquet
16:00 Krzysztof Rutkowski

On projected dynamical system related to best approximation primal-dual algorithm for solving maximally monotone operators inclusion problem

16:25 Marco Prato

A variable metric nonlinear Gauss-Seidel algorithm for nonconvex nonsmooth optimization

16:50 Jean-Christophe Pesquet

A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression

H 3012 | STO Stochastic Optimization and Its Applications (3/3)
Christian Bayer
Xiaobo Li
16:00 Christian Bayer

Pricing American options by exercise rate optimization

16:25 Xiaobo Li

Inventory Repositioning in On-Demand Product Rental Networks

16:50