Room Invited Talks - Monday 11:00 AM – 12:00 AMAuditorium On the relationship between machine learning and optimization, Organizer: Michel Goemans, session 552 PLENARYBuild Symph H, Z 0Gambetta1x60 min

Francis Bach, On the relationship betweenmachine learning and optimization

1

Room Invited Talks - Monday 1:30 PM – 2:30 PMAuditorium Multiobjective Optimization with PDE Constraints, Organizer: Stephen J Wright, session 550 SEMIBuild Symph H, Z 0Gambetta1x60 min

Michael Hintermuller, MultiobjectiveOptimization with PDE Constraints

SIGALAS What’s happening in nonconvex optimization? A couple of stories,Organizer: Jean-Baptist Hiriart-Urruty, session 536

KEYNOTE

Build C, Z 22nd floor1x60 min

Emmanuel Candes, What’s happening innonconvex optimization? A couple of sto-ries

DENIGES Theoretical Analysis of Cutting-Planes in IP Solvers., Organizer: Gerard Cornuejols, session 538 KEYNOTEBuild C, Z 5Ground Floor1x60 min

Santanu Dey, Theoretical Analysis ofCutting-Plane Selection in IP Solvers.

2

Room Discrete Optimization & Integer Programming - Monday 3:15 PM – 4:45 PMSalle 43 Provable guarantees for Cut Generating Functions, Organizer: Amitabh Basu, session 220 IPtheoryBuild C, Z 13rd floor3x30 min

Joseph Paat, Using the geometry of S-freesets to find mixed-integer cut-generatingfunctions

Sriram Sankaranarayanan, Can cut gener-ating functions be good and efficient?

Amitabh Basu, Optimal cutting planesfrom the group relaxations

Salle 44 IP Practice I, Chair: Maurice Queyranne, session 506 IPpracticeBuild C, Z 13rd floor3x30 min

RaphaelHauser, IP models for dimension-ality reduction and feature selection in cat-egorical da

Carlos Cardonha, Network models formultiobjective discrete optimization

Maurice Queyranne, Optimum Turn-Restricted Paths, Nested Compatibility,and Optimum Convex Polygons

Salle 39 Exact Optimization Algorithms for Compressed Sensing, Organizer: Marc E Pfetsch, session 56 MINLPBuild E, Z 13rd floor3x30 min

Christoph Brauer, A primal-dual homo-topy algorithm for sparse recovery with inf.norm constraints

Andreas Tillmann, SparkMIP: Mixed-Integer Programming for the (Vector) Ma-troid Girth Problem

FredericMatter, Complex-valued `0 min-imization problems with constant modulusconstraints

Salle 34 Tight relaxations in nonconvex MINLP, Organizer: Ambros Gleixner, session 128 MINLPBuild B, Z 31st floor3x30 min

Emily Speakman, Using mixed volume the-ory to compute convex hull volume for tri-linear monomials

Stefan Vigerske, Revising the handling ofnonlinear constraints in SCIP

Ambros Gleixner, Two-dimensional Pro-jections for Separation and Propagation ofBilinear Terms

Salle 35 MINLP methods in gas transport optimization (I), Organizer: Lars Schewe, session 162 MINLPBuild B, Z 4Intermediate3x30 min

Lars Schewe, MIP techniques for insta-tionary gas transport optimization and gasmarket models

NickMertens, Solving MINLPs by Simul-taneous Convexification with Applicationto Gas Networks

Falk Hante, Complementarity-BasedNonlinear Programming Techniques forOptimal Mixing in Gas

LEYTEIRE Geometry of Polynomials and Applications in Approximate Counting,Organizer: Shayan Oveis Gharan, session 99

APPROX

Build E, Z 13rd floor3x30 min

Guus Regts, On a conjecture of Sokal onthe location of roots of the independencepolynomial

Piyush Srivastava, Zeros of polynomialsand Ising partition functions

Nima Anari, A Deterministic Approxima-tion Algorithm for Counting Bases of Ma-troids

Salle 36 Matching and Matroids, Organizer: José A Soto, session 341 APPROXBuild B, Z 4Intermediate3x30 min

Maximilien Burq, Maximizing Efficiencyin Dynamic Matching Markets

Morteza Zadimoghaddam, OnlineWeighted Matching: Beating the 1/2Barrier

Jose Soto, Strong Algorithms for the Ordi-nal Matroid Secretary Problem

SIGALAS On the Tree Augmentation Problem, Organizer: Laura Sanità, session 240 COMBBuild C, Z 22nd floor3x30 min

David Adjiashvili, Beating ApproximationFactor 2 For Weighted Tree AugmentationWith Bounded Costs

Jochen Koenemann, Improved Approxima-tion for Tree Augmentation via ChvatalGomory Cuts

Rico Zenklusen, Improved Approxima-tion for Tree Augmentation: Saving byRewiring

Salle 41 Scheduling with setup, uncertainty and precedences, Organizer: Monaldo Mastrolilli, session 419 COMBBuild C, Z 13rd floor3x30 min

Kim-Manuel Klein, Empowering theConfiguration-IP

Nicole Megow, Scheduling under Ex-plorable Uncertainty

Jose Verschae, Min-sum scheduling underprecedence constraints

DURKHEIM Global Optimization, Organizer: Hassan Hijazi, session 299 CPBuild A, Z 13rd floor3x30 min

Adam Ouorou, A class of proximal al-gorithms based on Chebychev centers fornonsmooth convex o

Kaarthik Sundar, Convex relaxations forMixed-Integer Multilinear Functions

Tillmann Weisser, Sparse Certificates forPolynomial Optimization

3

Room Optimization under Uncertainty - Monday 3:15 PM – 4:45 PMSalle 32 Scenario discretization techniques in stochastic optimization, Organizer: Fabian Bastin, session 287 StochBuild B, Z 5Ground Floor3x30 min

Thuy Anh Ta, On a two-stage stochasticoptimization problem with stochastic con-straints

Julien Keutchayan, Multistage stochasticoptimization: discretization of probabilitydistributions

Michel Gendreau, Effective Heuristics forthe Short-Term Hydro-Generation Plan-ning Problem

DENIGES Preference robust optimization, Organizer: Erick Delage, session 166 RobustBuild C, Z 5Ground Floor3x30 min

William Haskell, Robust choice withmulti-attribute quasi-concave choice func-tions

Jonathan Li, Optimizing aspirational pref-erences when the choice of a measure isambiguous

Erick Delage, Utility-based Shortfall RiskModels when Preference Information is In-complete

Salle 33 Distributionally Robust Optimization - New Theory and Applications,Organizer: Zhichao Zheng, session 356

Robust

Build B, Z 5Ground Floor3x30 min

Yini Gao, Data-Driven Bounded Rational-ity in Games- A Robust Framework

Cagil Kocyigit, Distributionally RobustMechanism Design

Zhichao Zheng, Schedule Reliability inLiner Shipping by Distributionally RobustOptimization

Salle 31 Approximate dynamic programming, Organizer: David Brown, session 159 MarkovBuild B, Z 5Ground Floor3x30 min

Martin Haugh, Information RelaxationBounds for Partially Observed Markov De-cision Processes

Huseyin Topaloglu, Approximate Dy-namic Programming for Dynamic Assort-ment Optimization

David Brown, Approximations to Stochas-tic Dynamic Programs via Information Re-laxation Duality

Salle 30 Risk and Energy Markets, Chair: Julio Deride, session 376 GameBuild B, Z 5Ground Floor3x30 min

Olivier Huber, On solving risk-averseequilibrium problems via reformulations

Henri Gerard, On risk averse competitiveequilibrium

Julio Deride, Stochastic General Equilib-rium Model with Application to EnergyMarkets

4

Room Continuous Optimization - Monday 3:15 PM – 4:45 PMGINTRAC Polynomial and tensor optimization I, Organizer: Jiawang Nie, session 5 NLPBuild Q, Z 8Ground Floor3x30 min

Jean Lasserre, Sparse Polynomial Inter-polation: Compressed Sensing, Super-resolution, or Prony?

Stephane Gaubert, Eigenvalues inequali-ties for nonnegative tensors and their trop-ical analogues

Harm Derksen, Signal Denoising, Tensorsand Singular Values

Salle 05 Convex regularization and inverse problems, Organizer: Pierre Weiss, session 216 NLPBuild Q, Z 111st floor3x30 min

Vincent Duval, T-systems for super-resolution microscopy

Frederic De Gournay, Convex regularisa-tion, sparsity and representation theorem

Jonas Kahn, Bounds on the size of polye-dral cones

Salle KC7 Sparse Recovery, Chair: Mustafa C Pinar, session 432 NLPBuild K, Z 10Intermediate 23x30 min

John Chinneck, LP-based Sparse SolutionsRevisited

Mustafa Pinar, Sparse Recovery and Con-vex Quadratic Splines

Olof Troeng, Efficient `0 Trend Filtering

Salle 8 Nonconvex Optimization: Theory and Methods - Part 1, Organizer: Shoham Sabach, session 184 NonSmoothBuild N, Z 124th floor3x30 min

Jerome Bolte, From error bounds to thecomplexity of first-order descent methods

Yakov Vaisbourd, Globally Solving theTrust Region Subproblem Using SimpleFirst-Order Methods

Shoham Sabach, Nonconvex Lagrangian-Based Optimization: Schemes and GlobalConvergence

Salle 9 Adaptivity in non smooth optimization, Organizer: Masaru Ito, session 558 NonSmoothBuild N, Z 124th floor2x30 min

Masaru Ito, An adaptive first ordermethod for weakly smooth and uniformlyconvex problems

Somayya Komal, A Subgradient Algorithmfor solving variational Inequality Problem

Salle 20 Using SDP relaxations and solving them faster, Organizer: Elisabeth Gaar, session 113 SDPBuild G, Z 61st floor3x30 min

Samuel Burer, Exact SDPs for a Classof (Random and Non-Random) Noncon-vex QCQPs

Nicolo Gusmeroli, SDP Based SolutionMethods for Binary Quadratic Problems

Yuzixuan Zhu, Sieve-SDP: A simple facialreduction algorithm to preprocess SDPs

Salle LC5 Algorithms for nonlinear conic problems, Chair: Takayuki Okuno, session 463 SDPBuild L, Z 10Intermediate 13x30 min

Leonardo Mito, Augmented Lagrangianfor nonlinear SDPs applied to the coveringproblem

Cunlu Zhou, Long-Step Path-FollowingAlgorithm for Nonlinear Symmetric Pro-gramming Problems

Takayuki Okuno, A primal-dual path fol-lowing method for nonlinear semi-infiniteSDPs

Salle 06 Proximal Methods for Structured Problems, Organizer: Ting Kei Pong, session 147 VariatBuild Q, Z 111st floor3x30 min

Tianxiang Liu, A successive DC approxi-mation method for nonconvex nonsmoothoptimization

Man-Chung Yue, Cubic RegularizationRevisited: Faster (Local) Rates underWeaker Assumptions

TingKei Pong, Iteratively reweighted l1 al-gorithms with extrapolation

Salle ARNOZAN Algorithms for optimization and variational problems with possibly nonisolated solutions I,Organizer: Andreas Fischer, session 152

Variat

Build Q, Z 8Ground Floor3x30 min

Nico Strasdat, A special complementarityfunction revisited

Alexey Izmailov, Critical solutions of non-linear equations: attraction for Newton-type methods

Andreas Fischer, Local attraction of New-ton methods to critical solutions of con-strained systems

Salle KC6 Coordinate Descent and Randomized Direct Search Methods, Organizer: Martin Takac, session 211 RandomMBuild K, Z 10Intermediate 13x30 min

Asu Ozdaglar, When Cyclic CoordinateDescent Outperforms Randomized Coordi-nate Descent

El houcine Bergou, Random direct searchmethod for unconstrained smooth mini-mization

Dimitri Papageorgiou, Active MetricLearning for Supervised Classification

Salle 21 Mixed-integer derivative-free optimization, Chair: Clément Royer, session 80 DerFreeBuild G, Z 6Intermediate3x30 min

Andrew Conn, Underlying algorithms andtheory to our approach to MINLP withoutderivatives

Delphine Sinoquet, Benchmark of a trustregion method for solving black-boxmixed-integer problems

Ubaldo Garcia Palomares, A unified ap-proach for solving mixed integer Box-Constrained optimization

Salle AURIAC Theory and Methods for ODE- and PDE-Constrained Optimization 1, Chair: Carl M Greiff, session 331 ControlBuild G, Z 61st floor3x30 min

Behzad Azmi, On the Barzilai-Borweinstep-sizes in Hilbert spaces

Benjamin Horn, Shape Optimization withStress Constraints for Frictional ContactProblems

Carl Greiff, Quadratic programmimg fortime-optimal control in differentially flatsystems

5

Room Specific Models, Algorithms, and Software - Monday 3:15 PM – 4:45 PMFABRE Distributed Optimization, Organizer: Franck Iutzeler, session 325 LearningBuild J, Z 8Ground Floor3x30 min

Franck Iutzeler, Distributed Optimizationwith Sparse Communications and Struc-ture Identification

Guanghui Lan, Random gradient extrapo-lation for distributed and stochastic opti-mization

Alexander Gasnikov, Distributed Com-putation of Wasserstein Barycenters overNetworks

Salle 16 Decisions and learning from data, Chair: Christopher McCord, session 481 LearningBuild I, Z 72nd floor3x30 min

Cedric Rommel, Gaussian mixture penal-ization for trajectory optimization prob-lems

Christopher McCord, Optimization overContinuous Decisions with ObservationalData

Oskar Schneider, Combining MachineLearning and Optimization: Learning toemulate an expert

PITRES Facility Layout, Chair: Anders N Gullhav, session 450 LogisticsBuild O, Z 8Ground Floor3x30 min

Mirko Dahlbeck, Combinatorial Boundsfor the (extended) Double Row FacilityLayout Problem

Anders Gullhav, A Matheuristic Ap-proach to the Hospital Facility LayoutProblem

Hanane Khamlichi, A Multi task robot lay-out optimization with inventory lot-sizingproblem

Salle 23 Combinatorial Optimization in Chip Design, Organizer: Stefan Hougardy, session 257 SchedulingBuild G, Z 63rd floor3x30 min

Ulrich Brenner, Faster Adder Circuits forInputs with Prescribed Arrival Times

Pascal Cremer, BonnCell: Automatic CellLayout for 7nm Processors

Siad Daboul, Provably Fast and Near-Optimum Gate Sizing

Salle DENUCE Progress in Algorithms for Optimal Power Flow Problems I, Organizer: Miguel F Anjos, session 8 EnergyBuild Q, Z 8Ground Floor3x30 min

Manuel Ruiz, Solving an Optimal PowerFlow (OPF) problem with preventive secu-rity constraints

MiguelAnjos, Tight-and-Cheap Conic Re-laxation for the AC Optimal Power FlowProblem

Mostafa Sahraei Ardakani, CoordinatedPlanning and Operation of M-FACTS andTransmission Switching

Salle 24 Topics in power systems, Organizer: Alberto J Lamadrid, session 438 EnergyBuild G, Z 63rd floor3x30 min

Giulia De Zotti, Consumers FlexibilityEstimation at the TSO Level for BalancingServices

Joshua Taylor, Decentralized control ofDC-segmented power systems

Alberto Lamadrid, Response to Disrup-tions in Electricity with Stochastic Micro-grids

Salle LA4 Portfolio Optimization, Chair: Bernardo K. Pagnoncelli, session 393 SciencesBuild L, Z 8Basement3x30 min

Luca Mencarelli, A MultiplicativeWeights Update Algorithm for PortfolioSelection Problems

Bernardo Pagnoncelli, Regularized port-folio optimization with risk measures

Sina Yansori, Log-optimal portfolios un-der random horizon

Salle 22 Implementation of interior-point methods for large-scale problems and applications I,Organizer: Jordi Castro, session 353

Algo

Build G, Z 62nd floor2x30 min

Jose Herskovits, A feasible direction in-terior point algorithm for linear program-ming

Stefano Nasini, A specialized interior-point algorithm for very large minimumcost flows in bipa

Salle 18 Advances in Linear, Non Linear and Mixed-Integer Optimization, Chair: Hiroshige Dan, session 400 AlgoBuild I, Z 71st floor3x30 min

Erik Muhmer, Computational Experi-ments with Nested Dantzig-Wolfe Decom-positions

Xavier Schepler, Restrict-and-fix: a con-structive heuristic for mixed-integer pro-grams

Hiroshige Dan, Automatic DifferentiationSoftware for Indexed Optimization Prob-lems

6

Room Discrete Optimization & Integer Programming - Monday 5:00 PM – 6:30 PMSalle 34 Lattice methods in Integer Optimisation, Organizer: Iskander Aliev, session 78 IPtheoryBuild B, Z 31st floor3x30 min

Gennadiy Averkov, Approximation of cor-ner polyhedra with intersection cuts

Timm Oertel, The Support of Integer Opti-mal Solutions

Iskander Aliev, Distances to LatticePoints in Knapsack Polyhedra

Salle 44 Data Mining, Chair: Marcus V Poggi, session 504 IPpracticeBuild C, Z 13rd floor4x20 min

Takahiro Kan, A weighting local searchfor huge assignment problems in item rec-ommendation

AtsushiMiyauchi, Exact Clustering via In-teger Programming and Maximum Satisfi-ability

Dennis Kreber, The best subset selectionproblem in regression

Marcus Poggi, Cut and Column Genera-tion for Process Discovery

Salle 36 IP Practice II, Chair: Petra M. Bartmeyer, session 508 IPpracticeBuild B, Z 4Intermediate4x20 min

Gael Guillot, Application of the SSSDPmethod to combinatorial optimisationproblems

Yi-Shuai Niu, A Parallel Branch andBound with DC Algorithm for Mixed In-teger Optimization

Quentin Viaud, Two-dimensional binpacking problem with defects on bins

Petra Bartmeyer, A new approach to re-lax the binary variables on binary quadraticproblems

DURKHEIM Mixed-Integer Conic Optimization, Organizer: Sven Wiese, session 57 MINLPBuild A, Z 13rd floor3x30 min

Lucas Letocart, Exact methods based onSDP for the k-item quadratic knapsackproblem

Tristan Gally, Knapsack Constraints overthe Positive Semidefinite Cone

SvenWiese, The Mixed-integer Conic Op-timizer in MOSEK

Salle 39 Polynomial optimization in binary variables, Organizer: Elisabeth Rodriguez-Heck, session 58 MINLPBuild E, Z 13rd floor3x30 min

Arnaud Lazare, Unconstrained 0-1polynomial optimization through convexquadratic reformulation

Anja Fischer, A study of specially struc-tured polynomial matroid optimizationproblems

Elisabeth Rodriguez-Heck, Linear andquadratic reformulations of nonlinear 0-1optimization problems

Salle 35 MINLP methods in gas transport optimization (II), Organizer: Lars Schewe, session 163 MINLPBuild B, Z 4Intermediate3x30 min

Benjamin Hiller, Exploiting acyclic orien-tations to solve nonlinear potential-basedflow problems

Kai Becker, ASTS-Orientations on Undi-rected Graphs - A tool for optimizing net-work flows

Johannes Thurauf, Robust Optimal Dis-crete Arc Sizing for Tree-Shaped PotentialNetworks

LEYTEIRE Scheduling and File Migration, Chair: Asaf Levin, session 345 APPROXBuild E, Z 13rd floor3x30 min

Liliana Grigoriu, Scheduling on UniformNonsimultaneous Parallel Machines

Marcin Bienkowski, On phase-based algo-rithms for online file migration

Asaf Levin, A unified framework for de-signing EPTAS’s for load balancing onparallel machine

Salle 43 Algorithms for matching markets, Organizer: Amin Saberi, session 467 APPROXBuild C, Z 13rd floor4x20 min

Arash Asadpour, Concise BiddingThrough Dependent Randomized Round-ing

Balasubraman Sivan, Robust RepeatedAuctions under Heterogeneous Buyer Be-havior

Vahab Mirrokni, Proportional Allocation:Simple, Distributed, and Diverse Matchingw High Entropy

Amin Saberi, Matching in dynamic envi-ronments

SIGALAS Combinatorial optimization and convexity, Chair: Yu Yokoi, session 424 COMBBuild C, Z 22nd floor4x20 min

Yuni Iwamasa, Discrete convexity in bi-nary VCSPs

Fei Wang, Low matrix completion by amajorized penalty approach

Georg Loho, Abstract tropical linear pro-gramming

Yu Yokoi, List Supermodular Coloring

Salle 41 Practical aspects of network optimization, Chair: Kai Hoppmann, session 427 COMBBuild C, Z 13rd floor4x20 min

Sonia Vanier, Energy-Efficient in Multi-Hop Wireless Networks Problem

Keisuke Hotta, Optimal division for themulti-member constituency system

Saman Eskandarzadeh, MaintenanceScheduling in a Railway Corridor

Kai Hoppmann, Pushing a Network toits Limits - Finding Maximum Min-Cost-Flows

7

Room Optimization under Uncertainty - Monday 5:00 PM – 6:30 PMSalle 32 Distributionally Robust Stochastic Programming: Theory and Applications,

Organizer: Ran Ji, session 250Stoch

Build B, Z 5Ground Floor3x30 min

Yiling Zhang, Ambiguous Chance-constrained Binary Programs UnderMean-covariance Information

Karthyek Murthy, Distributionally Ro-bust Optimization with optimal transport(Wasserstein) costs

Ran Ji, Distributionally Robust Chance-Constrained Optimization with Wasser-stein Metric

Salle 30 Differentiability, convexity, and modeling in stochastic optimization, Chair: Kai A. Spuerkel, session 493 StochBuild B, Z 5Ground Floor3x20 min

Holger Heitsch, Stochastic optimizationwith probabilistic/robust (probust) con-straints

Pedro Perez-Aros, Subdifferential charac-terization of probability functions

Kai Spuerkel, Strong Convexity inStochastic Programming with DeviationRisk Measures

DENIGES Advances in Adjustable Robust Optimization, Organizer: Do Young Yoon, session 350 RobustBuild C, Z 5Ground Floor3x30 min

Dick den Hertog, Robust optimization formodels with uncertain SOC and SDP con-straints

Ernst Roos, Approximation of uncertainconvex inequalities

Do Young Yoon, Monitoring with LimitedInformation

Salle 37 New models in robust optimization, Chair: Juan S Borrero, session 459 RobustBuild B, Z 4Intermediate3x20 min

Jaeyoong Lim, On using cardinality con-strained uncertainty for objective coeffi-cients

Philip Kolvenbach, Robust optimization ofPDE-constrained problems using second-order methods

Juan Borrero, Robust optimization withnon-convex uncertainty sets

Salle 31 Learning and dynamic programming, Chair: Boxiao Chen, session 381 MarkovBuild B, Z 5Ground Floor2x30 min

Manu Gupta, A unifying computation ofWhittle’s Index for Markovian bandits

Jose Nino-Mora, A verification theoremfor indexability of real-state restless ban-dits

8

Room Continuous Optimization - Monday 5:00 PM – 6:30 PMGINTRAC Gradient Methods for Constrained Optimization Problems, Organizer: Igor Konnov, session 4 NLPBuild Q, Z 8Ground Floor3x30 min

Igor Konnov, Simple Adaptive Versions ofIterative Optimization Methods

Alexander Zaslavski, Subgradient Projec-tion Algorithm with Computational Errors

Andrea Cristofari, An active-set frame-work for minimizing nonconvex functionsover the simplex

Salle 05 Polynomial and tensor optimization III, Organizer: Jiawang Nie, session 7 NLPBuild Q, Z 111st floor4x20 min

Lek-Heng Lim, Higher order cone pro-gramming

Ke Ye, Ranks and decompositions of Han-kel tensors

Annie Raymond, Symmetric Sums ofSquares over k-Subset Hypercubes

Jiawang Nie, Tight relaxations for polyno-mial optimization and lagrange multiplierexpression

Salle 9 Modeling in NLP, Chair: Laura Balzano, session 433 NLPBuild N, Z 124th floor3x20 min

Laura Balzano, Low Algebraic Dimen-sion Matrix Completion

Mirai Tanaka, DC programming algo-rithm for fully convex bilevel optimization

Nuttapol Pakkaranang, An inertial prox-imal point methods for solving minimiza-tion problems

Salle 8 Extending the Reach of First-Order Methods, Part I, Organizer: Haihao Lu, session 285 NonSmoothBuild N, Z 124th floor3x30 min

Benjamin Grimmer, Subgradient MethodConvergence Rates without Lipschitz Con-tinuity or Convexity

Yurii Nesterov, Relative smoothness con-dition and its application to third-ordermethods.

Haihao Lu, Generalized Stochastic Frank-Wolfe Method

Salle 20 Solving large scale convex composite programming, Organizer: Kim-Chuan Toh, session 130 SDPBuild G, Z 61st floor3x30 min

Kim-Chuan Toh, A block symmetricGauss-Seidel decomposition theorem forconvex composite QP

Xin Yee Lam, Fast algorithms for largescale generalized distance weighted dis-crimination

Yancheng Yuan, An Efficient SemismoothNewton Based Algorithm for ConvexClustering

Salle LC5 Convergence and Approximation in Conic Programming, Chair: Tamás Terlaky, session 465 SDPBuild L, Z 10Intermediate 13x30 min

Nuri Vanli, Convergence Rate of BlockCoordinate Ascent for Nonconvex Burer-Monteiro Method

Yuriy Zinchenko, Towards efficient ap-proximation of p-cones

Tamas Terlaky, Quadratic convergence tothe optimal solution of second-order conicoptimization

Salle 06 Nonlinear Optimization and Variational Inequalities VI, Organizer: Cong Sun, session 146 VariatBuild Q, Z 111st floor4x20 min

Fengmin Xu, Balance analysis of sparsityand robustness for portfolio adjustmentproblem

Chao Zhang, Two-stage stochastic pro-gram and stochastic variational inequalities

Xiao Wang, Proximal Stochastic Quasi-Newton methods for Nonconvex Compos-ite Optimization

Zhongming Wu, General inertial proximalgradient method for nonconvex nonsmoothoptimization

Salle ARNOZAN Variational Analysis 4, Organizer: Jo A. Brueggemann, session 370 VariatBuild Q, Z 8Ground Floor4x20 min

Jo Brueggemann, Path-following methodfor a class of obstacle problems with inte-gral constraints

Yboon Garcia Ramos, Nonconvex integra-tion using ε-subdifferentials

Yakui Huang, A family of two-point step-size gradient methods

Khoa Nguyen, Proximal alternating direc-tion method of multipliers in the noncon-vex setting

Salle KC6 Complexity of Randomized Algorithms, Organizer: Raghu Pasupathy, session 347 RandomMBuild K, Z 10Intermediate 13x20 min

Martin Morin, On the Convergence ofSAGA-like Algorithms

Bang Vu, On the linear convergence of theprojected stochastic gradient method

Raghu Pasupathy, The Complexity ofAdaptive Sampling Accelerated GradientDsescent

Salle 21 Advances in DFO I, Chair: Sébastien Le Digabel, session 40 DerFreeBuild G, Z 6Intermediate3x30 min

Warren Hare, Calculus Rules of the Sim-plex Gradient

Miguel Munoz Zuniga, Derivative freeglobal Optimization with categorical-continuous variables

Stefan Wild, A Taxonomy of Constraintsfor Blackbox-Based Optimization

Salle AURIAC Advances in optimization methods for time dependent problems:I,Organizer: Matthias Heinkenschloss, session 223

Control

Build G, Z 61st floor4x20 min

Mihai Anitescu, Exponentially convergentreceding horizon constrained optimal con-trol

Carl Laird, Parallel strategies forDAE optimization with direct Schur-complement decomp.

Johannes Haubner, Shape optimization forunsteady fluid-structure interaction

Matthias Heinkenschloss, A parallel-in-time gradient-type method for optimal con-trol problems

9

Room Specific Models, Algorithms, and Software - Monday 5:00 PM – 6:30 PMFABRE Riemannian geometry in optimization for learning, Organizer: Nicolas Boumal, session 320 LearningBuild J, Z 8Ground Floor4x20 min

Nicolas Boumal, Global rates of conver-gence for nonconvex optimization on man-ifolds

Ronny Bergmann, A parallel Douglas-Rachford algorithm for data on Hadamardmanifolds

Paul Breiding, Riemannian optimizationfor the canonical tensor rank approxima-tion problem

Junyu Zhang, Primal-Dual OptimizationAlgorithms over Riemannian Manifolds

Salle DENUCE Exploiting structure in constrained optimization, Organizer: Mihai Cucuringu, session 334 LearningBuild Q, Z 8Ground Floor4x20 min

Hemant Tyagi, Provably robust estimationof modulo 1 samples of a smooth function

Akiko Takeda, Efficient DC Algorithm forconstrained sparse optimization problems

Nikitas Rontsis, Distributionally Ambigu-ous Optimization Techniques for BatchBayesian Optimizati

Andre Uschmajew, On critical points ofquadratic low-rank matrix optimizationproblems

Salle 22 Sparsity, variable selection and efficient algorithms, Chair: Alex Sholokhov, session 475 LearningBuild G, Z 62nd floor4x20 min

Sam Tajbakhsh, Distributed algorithms forstatistical learning with structured sparsity

Jean Pauphilet, Sparse regression: Scal-able algorithms and empirical performance

Alex Sholokhov, Sparsified Huge-ScaleOptimization for Regularized RegressionProblems

Zixin Shen, Forward stepwise variable se-lection based on relative weights

Salle 16 Packing and Capacity Management, Chair: Eugene Zak, session 452 LogisticsBuild I, Z 72nd floor3x20 min

Marina Andretta, Solving Irregular StripPacking Problems with free rotations

Alexandre Le Jean, A 3D-knapsack prob-lem with truncated pyramids and static sta-bility constraint

Eugene Zak, Minimization of sum of in-verse sawtooth functions

Salle 18 Manufacturing, Chair: Younsoo Lee, session 530 SchedulingBuild I, Z 71st floor4x20 min

Sebastien Beraudy, Detailed productionplanning models for semiconductor man-ufacturing with profit

Teun Janssen, Scheduling in the Pho-tolithography Bay

Hugo Harry Kramer, Column generationand fix-and-optimize for the lot-sizing withremanufacturing

Younsoo Lee, On the discrete lot-sizingand scheduling problem with sequence-dependent setup

Salle 23 Novel data-driven OR techniques for power system operations and planning,Organizer: Juan M. Morales, session 52

Energy

Build G, Z 63rd floor3x30 min

Salvador Pineda Morente, ChronologicalTime-Period Clustering for Optimal Ca-pacity Expansion Planning

Christos Ordoudis, Energy and Re-serve Dispatch with Distributionally Ro-bust Joint Chance Constraints

Juan Morales, Predicting the electricitydemand response via data-driven inverseoptimization

Salle 24 Structure and Learning in Power Grid Optimization, Organizer: Deepjyoti Deka, session 135 EnergyBuild G, Z 63rd floor3x30 min

Gal Dalal, Chance-Constrained OutageScheduling using a Machine LearningProxy

Sidhant Misra, Statistical Learning ForDC Optimal Power Flow

Apurv Shukla, Non-Stationary StreamingPCA

Salle LA4 Structure from evidence, Organizer: Peter Gritzmann, session 386 SciencesBuild L, Z 8Basement3x30 min

Douglas Goncalves, Mathematical Pro-gramming in Quantum Information andComputation

Jorge Barreras, Detection of UninformedExperts

PeterGritzmann, On constrained flow andmulti assignment problems for plasma par-ticle tracking

PITRES Implementation of interior-point methods for large-scale problems and applications II,Organizer: Jordi Castro, session 352

Algo

Build O, Z 8Ground Floor3x30 min

Csaba Meszaros, On the implementationof the crossover algorithm

Aurelio Oliveira, Interior point methodsapplied to context-free grammar parameterestimation

Jordi Castro, A new specialized interior-point method for support vector machines

10

Room Discrete Optimization & Integer Programming - Tuesday 8:30 AM – 10:30 AMSalle 43 Extended formulations, Organizer: Stefan Weltge, session 219 IPtheoryBuild C, Z 13rd floor4x30 min

Michele Conforti, Balas formulation forthe union of polytopes is optimal

Tony Huynh, Strengthening Convex Re-laxations of 0/1-Sets Using Boolean For-mulas

Makrand Sinha, Lower Bounds for Ap-proximating the Matching Polytope

Stefan Weltge, Lifting Linear ExtensionComplexity Bounds to the Mixed-IntegerSetting

Salle 34 MIP under Uncertainty 1, Organizer: Fatma Kilinc-Karzan, session 231 IPtheoryBuild B, Z 31st floor3x30 min

Shabbir Ahmed, Distributionally RobustCombinatorial Optimization

Simge Kucukyavuz, Risk-Averse Set Cov-ering Problems

Ruiwei Jiang, Mixed-Integer Recourse viaPrioritization

Salle 35 Cutting Planes for Integer Programs, Chair: Matthias Köppe, session 512 IPtheoryBuild B, Z 4Intermediate4x30 min

Jiawei Wang, Characterization and Ap-proximation of General Dual-FeasibleFunctions

Yuan Zhou, All finite group complexity in-jects

Daniel Porumbel, Projective cutting-planes by projecting interior points ontopolytope facets

Matthias Koppe, cutgeneratingfunctionol-ogy: Python software for CGFs and super-additive duality

Salle 44 Machine Learning for Optimization, Organizer: Bistra Dilkina, session 138 IPpracticeBuild C, Z 13rd floor4x30 min

Bistra Dilkina, Machine Learning forBranch and Bound

Markus Kruber, Learning when to use adecomposition

Elias Khalil, Learning Combinatorial Op-timization Algorithms Over Graphs

Andrea Lodi, Learning Discrete Optimiza-tion

LEYTEIRE Streaming, Organizer: Michael Kapralov, session 228 APPROXBuild E, Z 13rd floor4x30 min

Eric Price, Counting subgraphs in graphstreams

David Woodruff, Sublinear Time LowRank Approximation of Positive Semidefi-nite Matrices

Pan Peng, Estimating Graph Parametersfrom Random Order Streams

Michael Kapralov, (1 + Ω(1))-Approximation to MAX-CUT RequiresLinear Space

Salle 36 Approximation Algorithms for Clustering, Organizer: Chaitanya Swamy, session 256 APPROXBuild B, Z 4Intermediate4x30 min

Sara Ahmadian, Better Guarantees for k-Means Problem using Primal-Dual Algo-rithms

Chris Schwiegelshohn, On the LocalStructure of Stable Clustering Instances

Benjamin Moseley, ApproximationBounds for Hierarchical Clustering

Chaitanya Swamy, Unifying k-Median andk-Center: Approximation Algorithms forOrdered k-Median

SIGALAS Matching games and beyond, Organizer: Jochen Koenemann, session 241 COMBBuild C, Z 22nd floor4x30 min

Zhuan Khye Koh, Stabilizing WeightedGraphs

Justin Toth, Computing the Nucleolus ofWeighted Cooperative Matching Games inPoly Time

Jannik Matuschke, New and simple algo-rithms for stable flow problems

Agnes Cseh, The complexity of cake cut-ting with unequal shares

Salle 41 Equilibrium Computation in Congestion Games, Organizer: Umang Bhaskar, session 242 COMBBuild C, Z 13rd floor4x30 min

Ioannis Panageas, Multiplicative WeightsUpdate with Constant Step-Size in Con-gestion Games

Tobias Harks, Equilibrium Computationin Resource Allocation Games

Guido Schafer, Computing Efficient NashEquilibria in Congestion Games

Umang Bhaskar, Equilibrium Computa-tion in Atomic Splittable Routing Gameswith Convex Costs

Salle 39 Exact approaches for problems over lattices and graphs, Chair: Daniele Catanzaro, session 425 COMBBuild E, Z 13rd floor4x30 min

Austin Buchanan, Why is maximumclique often easy in practice?

Matteo Cosmi, Scheduling for Last-MileFood Delivery

Martin Frohn, Optimizing over lattices ofunrooted binary trees: Part I - Foundations

Daniele Catanzaro, Optimizing over lat-tices of unrooted binary trees: Part II - Onthe BMEP

DURKHEIM Graphical Optimization Model 1, Organizer: Joris Kinable, session 295 CPBuild A, Z 13rd floor4x30 min

David Bergman, On the integrated last miletransportation problem

Willem-Jan van Hoeve, Cut Generationfor Integer (Non-)Linear Programming viaDecision Diagrams

Joris Kinable, Hybrid Optimization Meth-ods for Time-Dependent Sequencing Prob-lems

John Hooker, Compact Representation ofNear-Optimal Integer Programming Solu-tions

11

Room Optimization under Uncertainty - Tuesday 8:30 AM – 10:30 AMDENIGES Risk-averse stochastic programming, Organizer: Andrzej Ruszczynski, session 252 StochBuild C, Z 5Ground Floor4x30 min

Darinka Dentcheva, Asymptotics ofstochastic optimization problems withcomposite risk functionals

Ozlem Cavus, Multi-objective risk-aversetwo-stage stochastic programming prob-lems

Alexander Shapiro, Distributionally ro-bust stochastic programming

Andrzej Ruszczynski, Risk Disintegrationwith Application to Partially ObservableSystems

Salle 37 Nonlinear Optimization with Uncertain Constraints, Organizer: Charlie Vanaret, session 110 RobustBuild B, Z 4Intermediate3x30 min

Andreas Waechter, Nonlinear program-ming reformulations of chance constraints(Part 2)

Alejandra Pena-Ordieres, Nonlinear pro-gramming reformulations of chance con-straints (Part 1)

Sven Leyffer, Sequential Linearization forNonlinear Robust Optimization

Salle 33 Robust Optimization and Operations Mangement, Organizer: Chaithanya Bandi, session 410 RobustBuild B, Z 5Ground Floor3x30 min

Nikos Trichakis, Robustness of StaticPricing Policies in the Face of StrategicCustomers

Omar Besbes, Prior-Independent OptimalAuctions

Chaithanya Bandi, Design and Control ofMulti-class Queueing Networks via RobustOptimization

Salle 31 Algorithms for stochastic games : new approaches, Organizer: Hugo Gimbert, session 137 MarkovBuild B, Z 5Ground Floor4x30 min

Marcin Jurdzinski, Quasi-polynomial al-gorithms for solving parity games

Antonin Kucera, One-Counter StochasticGames with Zero-Reachability Objectives

MarcelloMamino, Around tropically con-vex constraint satisfaction problems.

Mateusz Skomra, The condition numberof stochastic mean payoff games

Salle 30 Algorithmic Game Theory I, Organizer: Luce Brotcorne, session 311 GameBuild B, Z 5Ground Floor4x30 min

Victor Bucarey, Solving Strong Stackel-berg Equilibrium in Stochastic Games

Frank Plein, Models for the single-mindedbundle pricing problem

Concepcion Dominguez, Branch-and-cutalgorithm for the Rank Pricing problem

Yury Kochetov, A matheuristic for thebilevel 0-1 public-private partnership prob-lem

12

Room Continuous Optimization - Tuesday 8:30 AM – 10:30 AMGINTRAC Stochastic and Nonlinear Optimization I, Organizer: Jorge Nocedal, session 47 NLPBuild Q, Z 8Ground Floor4x30 min

Raghu Bollapragada, A ProgressiveBatching L-BFGS Method for MachineLearning

Leon Bottou, Convexity "à la carte" Philip Thompson, On variance reductionfor stochastic optimization with multi-plicative noise

Frank Curtis, Characterizing Worst-CaseComplexity of Algorithms for NonconvexOptimization

Salle 05 Machine learning and sparse optimisation , Organizer: Coralia Cartis, session 109 NLPBuild Q, Z 111st floor4x30 min

Martin Lotz, Condition numbers andweak average-case complexity in opti-mization

Armin Eftekhari, A Long (Random) WalkSolves All Your (Linear) Problems

Florentin Goyens, Manifold lifting: prob-lems and methods

Jared Tanner, Sparse non-negative super-resolution: simplified and stabilized

Salle KC7 Unconstrained Optimization, Chair: Ekkehard Sachs, session 401 NLPBuild K, Z 10Intermediate 24x30 min

Andrea Caliciotti, SYMMBK algorithmapplied to Newton-Krylov methods for un-constrained optimization

Elisa Riccietti, Regularizing trust-regionmethods for ill-posed nonlinear least-squares problems

Massimo Roma, Approximate Inverse Pre-conditioning for Newton-Krylov methods

Ekkehard Sachs, Second Order Adjoints

Salle LC4 Advances in Bundle Methods for Convex Optimization, Organizer: Christoph Helmberg, session 93 NonSmoothBuild L, Z 9Intermediate 14x30 min

Frank Fischer, An Asynchronous ParallelBundle Method Based on Inexact Oracles

Antonio Frangioni, Fully Incremen-tal Bundle Methods: (Un)cooperative(Un)faithful Oracles and Upper

Elisabeth Gaar, The Bundle Method forGetting an Improved SDP Relaxation ofthe Stability Number

Christoph Helmberg, A Dynamic ScalingApproach for Bundle Methods in ConvexOptimization

Salle 8 Addressing problems with complex geometries, Organizer: Edouard Pauwels, session 229 NonSmoothBuild N, Z 124th floor4x30 min

Jerome Malick, Sensitivity analysis formirror-stratifiable convex functions

Courtney Paquette, An accelerated prox-imal method for minimizing compositionsof convex functions

Antoine Hochart, How to perturb semi-algebraic problems to ensure constraintqualification?

Edouard Pauwels, The multiproximal lin-earization method for convex compositeproblems

Salle 20 Algebraic and geometric aspects of semidefinite programming, Organizer: Hamza Fawzi, session 85 SDPBuild G, Z 61st floor4x30 min

James Saunderson, Certificates of poly-nomial nonnegativity via hyperbolic opti-mization

Xavier Allamigeon, Log-barrier interiorpoint methods are not strongly polynomial

AmyWiebe, Slack ideals of polytopes Dogyoon Song, Measuring Optimality Gapin Conic Programming Approximationswith Gaussian Width

Salle LC5 Theory and algorithms in conic linear programming 1, Organizer: Gabor Pataki, session 88 SDPBuild L, Z 10Intermediate 14x30 min

Henry Wolkowicz, Low-Rank MatrixCompletion (LRMC) using Nuclear Norm(NN) with Facial Reduction

Negar Soheili, Solving conic systems viaprojection and rescaling

Henrik Friberg, Projection and presolve inMOSEK: exponential and power cones

Levent Tuncel, TOTAL DUAL INTE-GRALITY FOR CONVEX, SEMIDEF-INITE, AND EXTENDED FORMULA-TIONS

Salle 06 Nonlinear Optimization and Variational Inequalities V, Organizer: Xin Liu, session 145 VariatBuild Q, Z 111st floor4x30 min

Yaohua Hu, Lower-order regularizationmethod for group sparse optimization withapplication

Tingting Wu, Solving ConstrainedTV2L1-L2 MRI Signal Reconstruction viaan Efficient ADMM

Oleg Burdakov, On solving saddle-pointproblems and non-linear monotone equa-tions

Javad Feizollahi, A first-order method forsemidefinite stochastic variational inequal-ity problems

Salle ARNOZAN Optmization Algorithms and Variational Inequalites I, Organizer: Bo Jiang, session 148 VariatBuild Q, Z 8Ground Floor4x30 min

Yu-Hong Dai, Smoothing quadratic regu-larization method for the hemivariationalinequalities

Deren Han, ADMM for OptimizationProblems Involving Nonconvex Functions

Xingju Cai, ADMM-based methods formonotone inverse variational inequalities

Bo Jiang, Vector Transport-Free SVRGwith General Retraction for RiemannianOptimization

Salle KC6 Larges Scale and Distributed Optimization, Organizer: Ermin Wei, session 214 RandomMBuild K, Z 10Intermediate 14x30 min

Pontus Giselsson, On Linear Conver-gence for Douglas-Rachford splitting andADMM

Jonathan Eckstein, Block-Iterative andAsynchronous Projective Splitting forMonotone Operators

Gesualdo Scutari, Achieving Geomet-ric Convergence for Distributed Asyn-chronous Optimization

Ermin Wei, Asynchronous DistributedNetwork Newton Method

Salle 21 Bayesian and Randomized Optimization II, Chair: Youssef Diouane, session 79 DerFreeBuild G, Z 6Intermediate4x30 min

Nathalie Bartoli, Adaptive modelingstrategy for high-dimensional constrainedglobal optimization

Robert Gramacy, Modeling an Aug-mented Lagrangian for Blackbox Con-strained Optimization

Victor Picheny, Bayesian optimization un-der mixed constraints

Zi Wang, Bayesian Optimization Guidedby Max-values

Salle AURIAC Optimization Methods for PDE Constrained Problems , Organizer: Michael Ulbrich, session 221 ControlBuild G, Z 61st floor4x30 min

Anton Schiela, An affine covariant com-posite step method with inexact step com-putations

Sebastian Garreis, Optimal Control underUncertainty: Adaptive Solution with Low-rank Tensors

Carlos Rautenberg, On the optimal con-trol of quasi-variational inequalities

Michael Ulbrich, Inexact bundle methodsfor nonconvex problems in Hilbert spacewith applications

13

Room Specific Models, Algorithms, and Software - Tuesday 8:30 AM – 10:30 AMFABRE Optimization in Statistical Learning, Organizer: Quentin Berthet, session 326 LearningBuild J, Z 8Ground Floor4x30 min

Jonathan Weed, Near-linear time approxi-mation algorithms for optimal transport

Andreas Elsener, Sharp Oracle In-equalities for nonconvex regularizedM-estimators

Alexandre d Aspremont, Sharpness,Restart and Compressed Sensing Perfor-mance

Fan Yang, Towards a deeper understandingof generalization for kernel learning

Salle DENUCE Statistics meets optimization: going beyond convexity, Organizer: John Duchi, session 337 LearningBuild Q, Z 8Ground Floor4x30 min

Mahdi Soltanolkotabi, Learning ReLUsand over-parameterized neural networksvia gradient descent

Ju Sun, When are nonconvex optimizationproblems not scary?

John Duchi, Solving composite optimiza-tion problems, with applications to phaseretrieval an

Rina Barber, Optimal iterative threshold-ing algorithms for sparse optimization

Salle 22 Pricing, Chair: Anastasiya Ivanova, session 478 LearningBuild G, Z 62nd floor4x30 min

Anastasiya Ivanova, Distributed price ad-justment for the resource allocation prob-lem

Yesmine Rouis, Price forecasting with ma-chine learning algorithms for recommerceactivities

Sara Calleja, Volume forecasting withmachine learning algorithms for recom-merce activities

Spyros Zoumpoulis, Optimal Pricing andIntroduction Timing of New Virtual Ma-chines

Salle 18 Path and tree problems, Chair: Arthur J Delarue, session 360 NetworkBuild I, Z 71st floor4x30 min

Andreas Karrenbauer, ApproximateShortest Paths and Transshipment inDistributed and Streaming Models

Dmytro Matsypura, Exact IP-based ap-proaches for the longest induced path prob-lem.

Kiyoshi Sawada, Adding Edges of ShortLengths Incident with the Root to Com-plete K-ary Tree

Arthur Delarue, Travel Time Estimationin the Age of Big Data

Salle 16 Facility Location, Chair: Ivan Contreras, session 414 LogisticsBuild I, Z 72nd floor3x30 min

Ivan Contreras, Exact solution of singlesource quadratic capacitated location prob-lems

Blas Pelegrin, Optimal multi-facility lo-cation for competing firms under quantitycompetition

Daniel Santos, A new formulation for theHamiltonian p-median problem

Salle 23 Electric Vehicles and Decarbonization, Chair: Martim Joyce-Moniz, session 519 EnergyBuild G, Z 63rd floor4x30 min

Paolo Pisciella, A techno-economic anal-ysis of the impact of decarbonization

FranciscoMunoz, Equilibrium Analysis ofa Carbon Tax With Pass-through Restric-tions

Daniel Olivares, Management of EVCharging Stations under Advance Reserva-tions Schemes

Martim Joyce-Moniz, Increasing electricvehicle adoption via strategic siting ofcharging stations

Salle 24 Risk Models for Electricity Markets, Chair: Michael C Ferris, session 521 EnergyBuild G, Z 63rd floor4x30 min

Daniel Ralph, Risky Capacity EquilibriumModels for risk averse investment equilib-ria

Ryan Cory-Wright, Payment mechanisms,efficiency savings and risk-aversion inelectricity markets

Fabio Moret, Risk and Information Shar-ing in Peer-to-Peer Electricity Markets

Michael Ferris, Dynamic Risked Equilib-rium for Energy Planning

Salle LA4 Interval Global Optimization, Organizer: Frederic Messine, session 339 SciencesBuild L, Z 8Basement4x30 min

Tibor Csendes, Nonlinear Symbolic Trans-formations for Simplifying Functions – In-terval Methods

Bertrand Neveu, An Interval Branch andBound Algorithm for Parameter Estima-tion

Dominique Monnet, Interval Branch-and-Bound Algorithm for semi-infinite pro-gramming

Frederic Messine, Reliable convex relax-ation techniques for interval global opti-mization codes

PITRES LP, Mixed Integer Convex Programming and Decomposition, Organizer: Thorsten Koch, session 236 AlgoBuild O, Z 8Ground Floor4x30 min

Miten Mistry, Optimising over Gradient-Boosted Regression Trees with ConvexPenalty Functions

Nikolaos Ploskas, An advanced initializa-tion procedure for the simplex algorithm

Stephen Maher, Experiments with a gen-eral Benders’ decomposition frameworkfor SCIP

Christian Puchert, Progress in theBranch-Price-and-Cut Solver GCG

14

Room Invited Talks - Tuesday 11:00 AM – 12:00 AMAuditorium Adaptive Robust Optimization with Scenario-wise Ambiguity Sets, Organizer: Daniel Kuhn, session 551 SEMIBuild Symph H, Z 0Gambetta1x60 min

Melvyn Sim, Adaptive Robust Optimiza-tion with Scenario-wise Ambiguity Sets

DENIGES Asymptotic Lagrangian duality for nonsmooth optimization, Organizer: Xiaojun Chen, session 541 KEYNOTEBuild C, Z 5Ground Floor1x60 min

Regina Burachik, Asymptotic Lagrangianduality for nonsmooth optimization

BROCA Lower bounds on the size of linear programs, Organizer: Volker Kaibel, session 545 KEYNOTEBuild W, Z 03rd floor1x60 min

Thomas Rothvoss, Lower Bounds on theSize of Linear Programs

15

Room Invited Talks - Tuesday 1:30 PM – 2:30 PMAuditorium The Resurgence of Proximal Methods in Optimization, Organizer: Claudia Sagastizabal, session 555 PLENARYBuild Symph H, Z 0Gambetta1x60 min

Marc Teboulle, The resurgence of proxi-mal methods in optimization

16

Room Discrete Optimization & Integer Programming - Tuesday 3:15 PM – 4:45 PMSalle 43 MIP under Uncertainty 2, Organizer: Simge Kucukyavuz, session 232 IPtheoryBuild C, Z 13rd floor3x30 min

Manish Bansal, Two-stage stochastic p-order conic mixed integer programs

Ward Romeijnders, Inexact cutting planetechniques for two-stage stochastic mixed-integer programs

Andrew Schaefer, Solving Stochastic andBilevel Mixed-Integer Programs via a Gen-eralized Value F.

Salle 44 Symmetry Handling in Integer Programs, Organizer: Christopher Hojny, session 129 IPpracticeBuild C, Z 13rd floor3x30 min

Cecile Rottner, Breaking full-orbitopalsymmetries and sub-symmetries

Domenico Salvagnin, Symmetry BreakingInequalities from the Schreier-Sims table

Christopher Hojny, Symmetry BreakingPolytopes: A Framework for SymmetryHandling in Binary Program

DURKHEIM Applications in Mixed-Integer Quadratic Programming, Organizer: Boshi Yang, session 107 MINLPBuild A, Z 13rd floor3x30 min

Boshi Yang, Improved Representations ofthe Quadratic Linear Ordering Problem

Areesh Mittal, Robust QCQPs UnderMixed Integer Uncertainty

Chiara Liti, Machine Learning and Opti-mization for Neuroscience

Salle 34 Convex relaxations in MINLP, Organizer: Adam N Letchford, session 278 MINLPBuild B, Z 31st floor3x30 min

Borzou Rostami, A convex reformulationand an outer approximation for a class ofBQP

Felipe Serrano, Separating over the con-vex hull of MINL constraints

Adam Letchford, Bi-Perspective Cuts forMixed-Integer Fractional Programs

Salle 35 Applications of MINLP, Organizer: Dolores Romero Morales, session 281 MINLPBuild B, Z 4Intermediate3x30 min

Claudia Lopez, Packing problem as mixedinteger non-linear model using formulationspace search

Steffen Rebennack, Piecewise LinearFunction Fitting via Mixed-Integer LinearProgramming

Dolores Romero Morales, Feature Selec-tion for Benchmarking

LEYTEIRE Algorithms in the Sharing Economy, Organizer: David Shmoys, session 22 APPROXBuild E, Z 13rd floor3x30 min

Anthony Kim, Minimizing Latency in On-line Ride and Delivery Services

Alice Paul, Broken Bike Docks and thePrize-Collecting Traveling Salesman Prob-lem

David Shmoys, Allocating capacity in bike-sharing systems

Salle 36 Local Search and Facility Location, Organizer: Felix Willamowski, session 342 APPROXBuild B, Z 4Intermediate3x30 min

Neelima Gupta, Local Search based Ap-proximation Algorithms for Capacitated kmedian problems.

Krzysztof Sornat, Proportional ApprovalVoting, Harmonic k-median, and NegativeAssociation

Felix Willamowski, Hard Instances forLocal Search via Mixed Integer Program-ming

Salle 41 New developments in prophet inequalities and related settings, Organizer: Ruben Hoeksma, session 258 COMBBuild C, Z 13rd floor3x30 min

Ashish Chiplunkar, Prophet Inequalityand Prophet Secretary

Brendan Lucier, Prophets, Secretaries,and Prices

TimOosterwijk, Posted Prices and Thresh-old Strategies for Random Arrivals

Salle 39 Submodular optimization and beyond, Chair: Satoru Iwata, session 418 COMBBuild E, Z 13rd floor3x30 min

MartinNagele, Submodular MinimizationUnder Congruency Constraints

Kenjiro Takazawa, The b-bibranchingProblem: TDI System, Packing, and Dis-crete Convexity

Satoru Iwata, Index Reduction via Uni-modular Transformations

17

Room Optimization under Uncertainty - Tuesday 3:15 PM – 4:45 PMSalle 32 Distributionally Robust and Stochastic Optimization: A Sampling/Scenario Perspective,

Organizer: Guzin Bayraksan, session 249Stoch

Build B, Z 5Ground Floor3x30 min

Alexander Zolan, Optimizing the Designof a Latin Hypercube Sampling Estimatorfor SAA

Jun-ya Gotoh, Out-of-sample analysis ofdistributionally robust optimization

Guzin Bayraksan, Effective Scenariosin Multistage Distributionally RobustStochastic Programs

Salle 33 Recent Advances in Robust Optimization I, Organizer: Phebe Vayanos, session 442 RobustBuild B, Z 5Ground Floor3x30 min

Vishal Gupta, Optimization in the Small-Data, Large-Scale Regime

VeliborMisic, Interpretable Optimal Stop-ping

Phebe Vayanos, Fair, Efficient, and Inter-pretable Policies for Allocating Scarce Re-sources

DENIGES Recent Advances in Robust Optimization II, Organizer: Wolfram Wiesemann, session 445 RobustBuild C, Z 5Ground Floor3x30 min

Jianzhe Zhen, A Robust Optimization Per-spective on Bilinear Programming

Huajie Qian, Calibrating Optimization un-der Uncertainty

WolframWiesemann, The DistributionallyRobust Chance Constrained Vehicle Rout-ing Problem

Salle 31 Market places and dynamic programming, Chair: Dan A Iancu, session 380 MarkovBuild B, Z 5Ground Floor3x30 min

Gonzalo Romero, Revenue Managementwith Repeated Customer Interactions

Boxiao Chen, Dynamic Inventory Controlwith Stockout Substitution and DemandLearning

Dan Iancu, Revenue Losses From IncomeGuarantees in Centralized Allocation Sys-tems

Salle 30 Game Theory and Energy Markets, Chair: Didier Aussel, session 375 GameBuild B, Z 5Ground Floor3x30 min

Anton Svensson, Constraint quali cationsfor parametrized optimization problemsand applications

Leonard vonNiederhausern, TrEMa: ATrilevel Energy Market Model

Didier Aussel, Electricity market modelwith elastic demand

18

Room Continuous Optimization - Tuesday 3:15 PM – 4:45 PMGINTRAC Sum-of-squares and moment problems: methods and applications, Organizer: Etienne De Klerk, session 2 NLPBuild Q, Z 8Ground Floor3x30 min

Amir Ali Ahmadi, LP, SOCP, andOptimization-Free Approaches to Polyno-mial Optimization

Krzysztof Postek, Distributionally robustoptimization with SOS polynomial densityfunctions and m

Georgina Hall, Nonnegative polynomials,and applications to learning

Salle KC7 Bridging NLP and Theoretical Computer Science, Organizer: Aleksander Madry, session 51 NLPBuild K, Z 10Intermediate 23x30 min

Aleksander Madry, Improved Max Flowand Bipartite Matching Algorithms via In-terior Point Method

Lorenzo Orecchia, First-order methods:from dynamical systems to discrete opti-mization

Yin Tat Lee, A homotopy method forlp regression provably beyond self-concordance

Salle 05 Interior Point Methods in Engineering Applications II, Organizer: Jacek Gondzio, session 61 NLPBuild Q, Z 111st floor2x30 min

Michal Kocvara, A multigrid interiorpoint method for large scale topology op-timization

Jacek Gondzio, Solving large-scale trusslayout optimization problems by a primal-dual IPM

Salle 9 Linear Optimization III, Chair: Rodrigo Mendoza Smith, session 439 NLPBuild N, Z 124th floor3x30 min

Rodrigo Mendoza Smith, Neural con-straint selection in Linear Programming

Chu Nguyen, New station cone algorithmvariant for linear programming and com-puting experiment

Khalid El Yassini, A predictor-correctoralgorithm for lp problems using the mixedpenalty approach

Salle 8 Nonconvex Optimization: Theory and Methods - Part 2, Organizer: Russell Luke, session 186 NonSmoothBuild N, Z 124th floor3x30 min

Guoyin Li, Splitting methods for noncon-vex feasibility problems

Patrick Johnstone, Projective Splittingwith Forward Steps

Russell Luke, Convergence Analysis forNonconvex Optimization Made Easy

Salle 20 Recent Advances in Conic Programming I, Organizer: Makoto Yamashita, session 82 SDPBuild G, Z 61st floor3x30 min

Bissan Ghaddar, Strong and Cheap SDPand SOCP Hierarchies for Polynomial Op-timization

Sunyoung Kim, BP: a Matlab packagebased on the Bisection and Projectionmethod for POPs

David Papp, Sum-of-squares optimizationwith and without semidefinite program-ming

Salle LC5 Relative Entropy Optimization II, Organizer: Venkat Chandrasekaran, session 112 SDPBuild L, Z 10Intermediate 13x30 min

Venkat Chandrasekaran, Newton Poly-topes and Relative Entropy Optimization

Timo deWolff, Optimization over the Hy-percube via Sums of Nonnegative CircuitPolynomials

Orcun Karaca, The REPOP Toolbox:Polynomial Optimization Using RelativeEntropy Relaxations

Salle 06 Nonlinear Optimization and Variational Inequalities III, Organizer: Xin Liu, session 143 VariatBuild Q, Z 111st floor3x30 min

Xinwei Liu, A primal-dual IPM with rapiddetection on infeasibility for nonlinear pro-grams

Wei Bian, Some discussion on nonsmoothconvex regression with cardinality penalty

Bo Wen, Proximal Algorithms with Ex-trapolation for Nonconvex NonsmoothProblems

Salle KC6 Recent Advances in Stochastic and Non-convex Optimization II, Organizer: Mingyi Hong, session 304 RandomMBuild K, Z 10Intermediate 13x30 min

TianbaoYang, First-order Stochastic Algo-rithms for Escaping From Saddle Points

John Birge, Markov chain Monte Carlomethods for Dynamic Stochastic Opti-mization

Jong-Shi Pang, Composite Difference-MaxPrograms for Modern Statistical Estima-tion Problems

Salle 21 Advances in DFO II, Chair: Warren Hare, session 37 DerFreeBuild G, Z 6Intermediate3x30 min

Yves Lucet, Variable-fidelity derivative-free algorithms for road design

Matt Menickelly, Derivative-Free RobustOptimization by Outer Approximations

Sebastien Le Digabel, The Mesh AdaptiveDirect Search algorithm for granular anddiscrete variables

Salle AURIAC Optimal Control and PDE Constrained Optimization, Organizer: Hasnaa Zidani, session 233 ControlBuild G, Z 61st floor3x30 min

Damien Allonsius, Control of semi dis-cretized (in space) systems of parabolicequations.

Francesca Chittaro, Strong local optimal-ity for generalised L1 optimal control prob-lems

Zheng Chen, Shortest Dubins Pathsthrough Three Points

19

Room Specific Models, Algorithms, and Software - Tuesday 3:15 PM – 4:45 PMSalle 16 Distributed and Asynchronous Learning, Organizer: Ion Necoara, session 323 LearningBuild I, Z 72nd floor3x30 min

Aditya Devarakonda, Avoiding communi-cation in first-order methods for convex op-timization

Marten van Dijk, On the Expected Con-vergence of SGD with Large Stepsizes

Puya Latafat, Asynchronous primal-dualproximal algorithms for large-scale opti-mization

FABRE Advances in large-scale machine learning, Organizer: Mark Schmidt, session 327 LearningBuild J, Z 8Ground Floor3x30 min

Francis Bach, Exponential convergence oftesting error for stochastic gradient meth-ods.

Volkan Cevher, Mirrored Langevin Dy-namics

Zaid Harchaoui, Catalyst Acceleration forGradient-based Optimization of StructuredModels

Salle 22 Learning for mixed integer optimization, Chair: Hari Bandi, session 482 LearningBuild G, Z 62nd floor2x30 min

Hari Bandi, Learning a Mixture of Gaus-sians via Mixed Integer Optimization

Takanori Maehara, Learning for TuningParameters of NUOPT MILP Solver

PITRES Pricing Methods, Organizer: Rafael Martinelli, session 182 LogisticsBuild O, Z 8Ground Floor3x30 min

Teobaldo Bulhoes Junior, A branch-and-price algorithm for the Minimum LatencyProblem

Jacques Desrosiers, Pricing, cycles, andpivots

Ruslan Sadykov, Branch-Cut-and-PriceSolver for Vehicle Routing Problems

Salle 23 Supply Chain and Lot Sizing, Chair: Simon Thevenin, session 534 SchedulingBuild G, Z 63rd floor3x30 min

Sixiang Zhao, Decision Rule-basedMethod for Flexible Multi-Facility Capac-ity Planning Problem

Kerem Akartunali, Two-Period Relax-ations for Big-Bucket Lot-Sizing: Polyhe-dra and Algorithms

Simon Thevenin, Scenario based stochas-tic optimization for the multi-echelon lot-sizing problem

Salle DENUCE Equilibrium Modelling in Energy, Organizer: Thomas Kallabis, session 290 EnergyBuild Q, Z 8Ground Floor3x30 min

Mirjam Ambrosius, Optimal Price Zonesand Investment Incentives in ElectricityMarkets

Thomas Kallabis, Strategic generation in-vestment using a stochastic rollinghorizonMPEC approach

Christoph Weber, Coordination Problemsin the Coupling of Gas and Electricity Mar-kets

Salle 24 Optimization Models for Renewable Energy Integration 2, Chair: Michel Denault, session 523 EnergyBuild G, Z 63rd floor3x30 min

Cristina Corchero, A MIP formulationof a Hybrid AC-DC offshore wind powerplant topology

Kristina Janzen, Optimal Design of a De-centralized Energy Network including Re-newable Energies

Michel Denault, Approximate dynamicprogramming for hydropower optimization

Salle LA4 Optimization in Medicine, Organizer: Sebastian Sager, session 394 SciencesBuild L, Z 8Basement3x30 min

Manuel Tetschke, Optimizing the indi-vidual treatment of patients with poly-cythemia vera

NelsonMaculan, Combinatorial Problemsand Models to Help Prevention and Com-bat Arboviruses

Sebastian Sager, Towards optimizedconsolidation (chemo)therapy for acutemyeloid leukemia

Salle 18 Optimization software and applications, Chair: Bartolomeo Stellato, session 399 AlgoBuild I, Z 71st floor3x30 min

Bartolomeo Stellato, OSQP: An Opera-tor Splitting Solver for Quadratic Programs

Navjot Kukreja, High-level abstractionsfor checkpointing in PDE-constrained op-timisation

Ivet Galabova, A quadratic penalty algo-rithm for linear programming

20

Room Invited Talks - Tuesday 3:15 PM – 4:45 PMSIGALAS A.W. Tucker Prize Session, Chair: Simge Kucukyavuz, session 559 INTERFACEBuild C, Z 22nd floor

21

Room Discrete Optimization & Integer Programming - Wednesday 8:30 AM – 10:30 AMSalle 43 Determinantal structures of IPs, Organizer: Martin Henk, session 131 IPtheoryBuild C, Z 13rd floor4x30 min

Stephan Artmann, Width in congruency-constrained TU-systems.

Friedrich Eisenbrand, Faster algorithmsfor Integer Programming using the SteinitzLemma

Christoph Glanzer, On the number of dis-tinct rows of a matrix with bounded sub-determinants

Robert Weismantel, Distances betweenLPs, IPs and MIPs

Salle 35 Advances in Integer Programming, Organizer: Santanu S Dey, session 230 IPtheoryBuild B, Z 4Intermediate4x30 min

Sanjeeb Dash, A generalization ofGomory-Chvatal cuts

BurakKocuk, Integer Programming Tech-niques for Optimal Transmission Switch-ing Problems

Alejandro Toriello, Time-indexed Relax-ations for the Online Bipartite MatchingProblem

Laurence Wolsey, Constant CapacityFlow Cover Inequalities on a Path or aVariant of Lot-Sizing

Salle 42 Primal Algorithms for Integer Programming Problems, Organizer: Daniel Aloise, session 338 IPtheoryBuild C, Z 13rd floor4x30 min

Adil Tahir, Integral Column GenerationAlgorithm for Set Partitioning Type Prob-lems

Omar Foutlane, Distributed Integral Sim-plex Using Decomposition for Set Parti-tioning Problems

Ilyas Himmich, A Polyhedral Study of theShortest Path Problem with Resource Con-straints

DanielAloise, A scalable algorithm for thesolution of large clustering problems

Salle 44 Benders Decomposition for Combinatorial and Bilevel Optimization, Organizer: Fabio Furini, session 171 IPpracticeBuild C, Z 13rd floor4x30 min

ArthurMaheo, A Framework for Benderswith Integer Sub-Problem

Paolo Paronuzzi, New ILP formulationsfor the k-Vertex Cut Problem

Ivana Ljubic, Decomposition Approachesto Covering Location Problems

Fabio Furini, The Maximum Clique Inter-diction Game

Salle 34 MINLP (I), Organizer: Daniel Bienstock, session 65 MINLPBuild B, Z 31st floor3x30 min

Bachir ElKhadir, Time-Varying Semidef-inite Programs

Kurt Anstreicher, Strengthened Relax-ations for Quadratic Optimization withSwitching Variables

James Renegar, A Simple Nearly-OptimalRestart Scheme For Speeding-Up First Or-der Methods

LEYTEIRE Approximation Algorithms for the Traveling Salesman Problem, Organizer: Anke van Zuylen, session 23 APPROXBuild E, Z 13rd floor4x30 min

Stephan Held, Vehicle Routing with Sub-tours

Kent Quanrud, Fast Approximations forMetric TSP

Jens Vygen, The s-t-path TSP: past,present, and future

Anke van Zuylen, The Salesman’s Paths:Layered Christofides’ Trees, Deletion andMatroids

Salle 36 Approximation Algorithms for Scheduling Problems, Organizer: Nicole Megow, session 72 APPROXBuild B, Z 4Intermediate4x30 min

Ruben Hoeksma, The general schedulingproblem with uniform release dates is notAPX-hard

Clifford Stein, Minimizing MaximumFlow Time on Related Machines via Dy-namic Pricing

Sven Jager, Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Ma-chine Scheduling

Julian Mestre, Precedence-ConstrainedMin Sum Set Cover

Salle 41 Discrete Convex Analysis, Organizer: Akiyoshi Shioura, session 243 COMBBuild C, Z 13rd floor4x30 min

Akiyoshi Shioura, M-convex FunctionMinimization under L1-distance Con-straint

Eric Balkanski, On the Construction ofSubstitutes

Fabio Tardella, Discrete Midpoint Con-vexity

SatokoMoriguchi, Scaling, proximity, andoptimization of integrally convex functions

Salle 39 Optimization under uncertainty, Organizer: Marco Molinaro, session 261 COMBBuild E, Z 13rd floor4x30 min

William Umboh, Online Probabilistic Met-ric Embedding and its Applications

Ravishankar Krishnaswamy, Online andDynamic Algorithms for Set Cover

Sahil Singla, Algorithms and AdaptivityGaps for Stochastic Probing

Marco Molinaro, Online and Random-order Load Balancing Simultaneously

DURKHEIM Learning in CP, Organizer: Arnaud Lallouet, session 301 CPBuild A, Z 13rd floor4x30 min

Nadjib Lazaar, Constraint acquisition Arnaud Lallouet, Reasoning withLearned Constraints

Arnaud Gotlieb, Boundary Estimation:Learning Boundaries for Constraint Opti-mization Problems

Michela Milano, Empirical Model Learn-ing: boosting optimization through ma-chine learning

22

Room Optimization under Uncertainty - Wednesday 8:30 AM – 10:30 AMDENIGES Chance Constraint and Its Applications, Organizer: Jianqiang Cheng, session 253 StochBuild C, Z 5Ground Floor4x30 min

Abdel Lisser, Joint chance constrainedgeneral sum games

Jia Liu, Distributionally robust geometricprograms with chance constraints

Francesca Maggioni, Bounds for proba-bilistic constrained problems

Jianqiang Cheng, Partial Sample AverageApproximation Method for Chance Con-strained Problems

Salle 32 Sampling and stability in stochastic optimization, Chair: Harsha Honnappa, session 488 StochBuild B, Z 5Ground Floor3x30 min

Edward Anderson, Distributional Robust-ness and Sample Average Approximation

Matthias Claus, On stability of stochasticbilevel programs with risk aversion

Gerard Cornuejols, From Estimation toOptimization via Shrinkage

Salle 37 Interfaces of Applied Probability and Optimization, Organizer: Omar El Housni, session 409 RobustBuild B, Z 4Intermediate4x30 min

Julien Grand Clement, Robust MarkovDecision Process: Beyond (and back to)Rectangularity

Omar El Housni, Beyond Worst-case: AProbabilistic Analysis of Affine Policies

Omid Nohadani, Sustainable InventoryWith Robust Periodic-affine Policies andMed. Supply Chains

Karthik Natarajan, Distributionally Ro-bust Markovian Traffic Equilibrium

Salle 33 Robust combinatorial optimization IV, Chair: Arie Koster, session 449 RobustBuild B, Z 5Ground Floor4x30 min

Pedro Munari, The vehicle routing prob-lem under uncertainty via robust optimiza-tion

Marina Leal, A time-dependent version ofthe robust TSP and SPP.

Arie Koster, Scheduling Jobs under Un-certainty: A Customer-oriented Approach

Roberto Wolfler Calvo, Optimizingthe electricity production planning withstochastic outage durations

Salle 30 Risk and Financial Markets, Chair: Markku J Kallio, session 377 GameBuild B, Z 5Ground Floor4x30 min

Stefano Nasini, Bilevel programming ap-proach for investment strategies under in-termediation

Yang Zhan, A smooth path-followingmethod for computing equilibria in incom-plete markets

Markku Kallio, Cooperative Mitigationof Contagion in Financial Networks

Zhenyu Hu, Stable Risk Sharing and ItsMonotonicity

23

Room Continuous Optimization - Wednesday 8:30 AM – 10:30 AMGINTRAC Stochastic and Nonlinear Optimization III, Organizer: Jorge Nocedal, session 31 NLPBuild Q, Z 8Ground Floor4x30 min

Fred Roosta, Efficient Newton-type meth-ods for non-convex machine learning prob-lems

Jorge Nocedal, Optimization Methods forTraining Neural Networks

Stephen Wright, A Newton-CG Methodwith Complexity Guarantees

Uday Shanbhag, Smoothed VariableSample-size Acc. Prox. Methods forStoch. Convex Optimization

Salle 05 Optimality conditions in NLP and conic problems, Organizer: Roberto Andreani, session 43 NLPBuild Q, Z 111st floor4x30 min

Roberto Andreani, A SEQUENTIAL OP-TIMALITY CONDITION RELATED TOTHE QUASINORMALITY CQ

Gabriel Haeser, An extension of Yuan’sLemma and its applications in optimization

Luis Felipe Bueno, Optimality Conditionsfor Generalized Nash Equilibrium Prob-lems

Tatiana Tchemisova, On Optimality Condi-tions for Linear Copositive Programming

Salle KC7 Computational advances in NLP, Chair: Jeffrey CH Pang, session 434 NLPBuild K, Z 10Intermediate 24x30 min

Alfonso Lobos Ruiz, Optimal Bidding,Allocation, and Budget Spending for aDemand-Side Platform.

Jeffrey Pang, Distributed deterministicasynchronous optimization using Dyk-stra’s splitting

Zhening Li, Decompositions and optimiza-tions of symmetric conjugate complexforms

Max Goncalves, An inexact Newton-like conditional gradient method for con-strained systems

Salle 9 Fixed Point Approaches, Chair: Poom Kumam, session 435 NLPBuild N, Z 124th floor4x30 min

Konrawut Khammahawong, Convergenceanalysis of S-iteration process for discon-tinuous operators

Poom Kumam, A new lgorithms for splitfeasibility problems involving paramono-tone equilibria

Khanitin Muangchoo-in, Fixed pointand convergence theorems for monotone(α, β)-nonexpansive

Wudthichai Onsod, Monotone generalizedalmost contraction on weighted graph

Salle LC4 Recent advances in first-order algorithms for non-smooth optimization,Organizer: Thomas Pock, session 198

NonSmooth

Build L, Z 9Intermediate 14x30 min

Peter Ochs, Non-smooth Non-convexBregman Minimization: Unification andnew Algorithms

YuraMalitsky, Primal-dual algorithm forlinearly constrained optimization problem

Matthias Ehrhardt, Stochastic PDHGwith Arbitrary Sampling and Applicationsto Medical Imaging

Stanislav Mazurenko, Acceleration andglobal convergence of the NL-PDHGM

Salle 8 Dynamical Systems and Optimization, Organizer: Hedy Attouch, session 351 NonSmoothBuild N, Z 124th floor4x30 min

Radu Ioan Bot, The continuous proximal-gradient approach in the nonconvex setting

Alexandre Cabot, Accelerated Forward-Backward Algorithms

Juan Peypouquet, Inertial proximal algo-rithms for maximally monotone operators

Silvia Villa, A dual diagonal iterative reg-ularization method

Salle AURIAC Recent Advances in Conic Programming II, Organizer: Sena Safarina, session 83 SDPBuild G, Z 61st floor4x30 min

Rujun Jiang, Convex Relaxations forNonconvex Quadratically ConstrainedQuadratic Program

Sena Safarina, Cone DecompositionMethod for Mixed-Integer SOCP arisingfrom tree breeding

Goran Banjac, Infeasibility detection inADMM for convex optimization

Marta Cavaleiro, A Simplex-like algo-rithm for the infimum point w.r.t. the sec-ond order cone

Salle 20 Theory and algorithms in conic linear programming 2, Organizer: Gabor Pataki, session 89 SDPBuild G, Z 61st floor4x30 min

Masakazu Muramatsu, An extension ofChubanov’s algorithm to symmetric coneprogramming

JoachimDahl, Extending MOSEK with ex-ponential cones

Stefan Sremac, Primal Facial Reductionin Semidefinite Programming and MatrixCompletions

Bruno Lourenco, Amenable cones: bridg-ing error bounds and facial reduction

Salle LC5 New trends II, Chair: Frank Permenter, session 500 SDP

Build L, Z 10Intermediate 14x30 min

ClaudiaAdams, An L2-approach to Copos-itivity

Faizan Ahmed, On algorithms to optimizehomogeneous polynomial over the simplexand the sphere

JohnMitchell, Complementarity formula-tions of rank minimization problems

Frank Permenter, Interior-point methodsvia the exponential map

Salle 06 Stochastic Optimization and Variational Inequalities II, Organizer: Alejandro R. Jofre, session 156 VariatBuild Q, Z 111st floor2x30 min

Yueyue Fan, How does uncertainty of de-mand propagate to flows under networkequilibrium

Alejandro Jofre, Variance-based stochas-tic extragradient methods with linearsearch for Stoch. VI

Salle ARNOZAN Variational Analysis 1, Organizer: Samir Adly, session 364 VariatBuild Q, Z 8Ground Floor4x30 min

Alexandra Schwartz, Second Order Op-timality Conditions for Cardinality Con-strained Problems

Helmut Gfrerer, Stability Analysis forParameterized Equilibria with Conic Con-straints

Michel Thera, Stability and Sensitiv-ity Analysis of Parametrized OptimizationProblems

Samir Adly, Sensitivity analysis of param-eterized nonlinear variational inequalities.

Salle KC6 First Order Methods for Non-Smooth Constrained Optimization, Organizer: Qihang Lin, session 305 RandomMBuild K, Z 10Intermediate 14x30 min

Shiqian Ma, On the Non-Ergodic Conver-gence Rate of an Inexact Augmented La-grangian Framework

Selvaprabu Nadarajah, A level-set methodfor stochastic optimization with expecta-tion constraints

Peng Zheng, Fast method for non-smoothnon-convex minimization

DaoLi Zhu, Stochastic Primal-Dual Coor-dinate Method for Nonlinear Convex ConePrograms

Salle 21 New derivative-free algorithms, Chair: Margherita Porcelli, session 34 DerFreeBuild G, Z 6Intermediate4x30 min

Margherita Porcelli, Gray-box optimiza-tion of structured problems and other newdevelopments in BFO

Francesco Rinaldi, Model-basedderivative-free methods for nonsmoothblack-box functions

Lindon Roberts, A flexible, robust andefficient derivative-free solver for leastsquares

Ana Custodio, MultiGLODS: Clever Mul-tistart in Multiobjective Directional DirectSearch

24

Room Specific Models, Algorithms, and Software - Wednesday 8:30 AM – 10:30 AMSalle 16 First-Order Methods for Machine Learning, Organizer: Fabian Pedregosa, session 319 LearningBuild I, Z 72nd floor3x30 min

Nicolas Flammarion, Stochastic Compos-ite Least-Squares Regression with conver-gence rate O(1/n)

Fabian Pedregosa, Adaptive Three Opera-tor Splitting

Sebastian Stich, Approximate CompositeMinimization: Convergence Rates and Ex-amples

FABRE Structured Optimization for Machine Learning and Signal Processing, Organizer: Lin Xiao, session 330 LearningBuild J, Z 8Ground Floor4x30 min

Donald Goldfarb, Training neural net-works using ADMM for multiaffine con-strai

Xinhua Zhang, Generalized ConditionalGradient for Structured Sparsity and Con-vex Deep Network

Lieven Vandenberghe, Proximal methodsfor optimization over nonnegative trigono-metric polynomials

Mikael Johansson, Fast convex optimiza-tion for eigenproblems and beyond

Salle 18 Robust network optimization, Organizer: Dimitri Papadimitriou, session 357 NetworkBuild I, Z 71st floor4x30 min

Joe Naoum-Sawaya, Decomposition Ap-proach for Robust Network Interdiction

Varun Reddy, Robust network slice designunder correlated demand uncertainties

Xudong Hu, Equilibria for Robust Routingof Atomic Players

Dimitri Papadimitriou, Reliable Multi-level Facility Location Problem (MFLP)

Salle DENUCE Decomposition Techniques to Solve Large-Scale Optimization Problems for Electricity and Natural GasSystems, Organizer: Ramteen Sioshansi, session 136

Energy

Build Q, Z 8Ground Floor4x30 min

Jean-Paul Watson, Toward ScalableStochastic Economic Dispatch on anIndustrial-Scale Model

David Pozo, Distributionally Robust Trans-mission Expansion Planning

Gerrit Slevogt, Structures and algorithmsfor nomination validation in steady-stategas networks

Giorgia Oggioni, A bilevel model for thewaste-to-energy supply chain in a circulareconomy

Salle 23 Energy-aware planning and scheduling 1, Organizer: Sandra U. Ngueveu, session 177 EnergyBuild G, Z 63rd floor4x30 min

Sophie Demassey, Robust optimisation ofstorage in a power generation expansionplanning problem

Peter Pflaum, Microgrid Energy Flexibil-ity Optimization – 3 use cases

Paolo Gianessi, ILP models for the job-shop scheduling problem with energy con-sideration

Sandra U. Ngueveu, Decompositionmethod in a scheduling problem withenergy storage and costs

Salle 24 Distribution and Demand Flexibility, Chair: Golbon Zakeri, session 510 EnergyBuild G, Z 63rd floor4x30 min

AlejandroAngulo, A Data–Driven RobustPower Management in Active DistributionSystems

Anja Hahle, Exploiting Flexibility inLoads for Balancing Power in ElectricalGrids

Paulin Jacquot, Analysis of a RoutingGame Model for Demand Side Manage-ment

Golbon Zakeri, Demand response in elec-tricity markets

Salle LA4 Energy markets, Organizer: Martine Labbé, session 50 SciencesBuild L, Z 8Basement3x30 min

Bernard Fortz, Unit Commitment underMarket Equilibrium Constraints

Martin Schmidt, The Impact of Physics onMarket Equilibria in Energy Networks

Martine Labbe, Dynamic programmingapproach for bidding problems on day-ahead markets

PITRES Progress in MIP Solvers I, Organizer: Michael Winkler, session 235 AlgoBuild O, Z 8Ground Floor3x30 min

Imre Polik, New features and improve-ments in the SAS/OR optimization pack-age

Thorsten Koch, MIPLIB 2017+1 Hans Mittelmann, Benchmarks of com-mercial and noncommercial optimizationsoftware

Salle 22 Numerically Efficient Methods for Piecewise Algorithmic Differentiation I,Organizer: Torsten F Bosse, session 269

Algo

Build G, Z 62nd floor4x30 min

Sri Hari Narayanan, Study of the nu-merical efficiency of structured abs-normalforms

Torsten Bosse, (Almost) Matrix-freesolver for piecewise linear functions inAbs-Normal form

Andreas Griewank, An active signaturemethod for piecewise differentiable/linearoptimization.

Angel Rojas, Solving l1 regularized mini-max problems by successive piecewise lin-earization

25

Room Invited Talks - Wednesday 8:30 AM – 10:30 AMSIGALAS Stochastic optimization, Chair: Alexei A. Gaivoronski, session 314 INTERFACEBuild C, Z 22nd floor4x30 min

Bernardo Costa, Using disjunctive pro-gramming to represent Risk Aversion poli-cies

Anthony Downward, SDDP withstagewise-dependent objective coeffi-cient uncertainty

Alexei Gaivoronski, Stochastic optimiza-tion of simulation models: management of

Kazem Abbaszadeh, Demand Response ToElectricity Prices In Flexible Manufactur-ing

26

Room Invited Talks - Wednesday 11:00 AM – 12:00 AMAuditorium Insights via volumetric comparison of polyhedral relaxations, Organizer: Andrea Lodi, session 548 SEMIBuild Symph H, Z 0Gambetta1x60 min

Jon Lee, Insights via volumetric compari-son of polyhedral relaxations

BROCA Monotone Operator Theory in Convex Optimization, Organizer: Samir Adly, session 537 KEYNOTEBuild W, Z 03rd floor1x60 min

Patrick Combettes, Monotone OperatorTheory in Convex Optimization

DENIGES Online Competitive Algorithms for Resource Allocation, Organizer: Frank E. Curtis, session 539 KEYNOTEBuild C, Z 5Ground Floor1x60 min

Maryam Fazel, Online Competitive Algo-rithms for Resource Allocation

LEYTEIRE Model-Based Methods, Sampling Models, and A New Second-Order Model-Based Method,Organizer: Stefan M Wild, session 546

KEYNOTE

Build E, Z 13rd floor1x60 min

Luis Nunes Vicente, Model-Based Meth-ods, Sampling Models, and A NewSecond-Order Model-Based Method

27

Room Invited Talks - Wednesday 1:30 PM – 2:30 PMAuditorium Relaxations and Approximations of Chance Constraints, Organizer: Simge Kucukyavuz, session 525 PLENARYBuild Symph H, Z 0Gambetta1x60 min

Shabbir Ahmed, Relaxations and Approxi-mations of Chance Constraints

28

Room Discrete Optimization & Integer Programming - Wednesday 3:15 PM – 4:45 PMSalle 44 Knapsack Problems, Organizer: Enrico Malaguti, session 185 IPpracticeBuild C, Z 13rd floor3x30 min

Ashwin Arulselvan, Algorithms forbilevel knapsack problem

Orlando Rivera-Letelier, Cutting Planesfor the Multi-Modal Precedence Con-strained Problem

Enrico Malaguti, The Fractional Knap-sack Problem with Penalties

Salle 36 Decomposition I, Chair: Dieter Weninger, session 486 IPpracticeBuild B, Z 4Intermediate3x30 min

Kerem Bulbul, Benders Decompositionand Column-and-Row Generation for LPsw/Column-Dependent Rows

Paul Stursberg, Improved Cut Selectionfor Benders Decomposition

Dieter Weninger, A Penalty AlternatingDirection Decomposition Framework forMIPs

DURKHEIM Decomposition methods for MINLP, Organizer: Ivo Nowak, session 55 MINLPBuild A, Z 13rd floor3x30 min

Ivo Nowak, Decomposition-based Succes-sive Approximation Methods for MINLP

Pavlo Muts, Decogo - A newdecomposition-based MINLP solver

EligiusHendrix, On simplicial monotonic-ity and dimension reduction in MINLP

Salle 34 MINLP (II), Organizer: Daniel Bienstock, session 66 MINLPBuild B, Z 31st floor3x30 min

Akshay Gupte, Polyhedral relaxations fornonconvex quadratic functions

Mohit Tawarmalani, Product convexifica-tion: A new relaxation framework for non-convex programs

Javad Lavaei, Sparse conic optimization:low-rank solutions and near-linear time al-gorithms

Salle 35 MINLP for Data Science, Organizer: Vanesa Guerrero, session 108 MINLPBuild B, Z 4Intermediate3x30 min

Sandra Benitez-Pena, Cost-sensitive SVM CristinaMolero-Rio, Optimizing classifi-cation trees via non-linear continuous pro-gramming

Vanesa Guerrero, MINLP to visualize dy-namic proximities and frequencies

LEYTEIRE Clustering, Organizer: Mohammad R Salavatipour, session 30 APPROXBuild E, Z 13rd floor3x30 min

Aravindan Vijayaraghavan, ClusteringMixtures of Well-Separated Gaussians

Konstantin Makarychev, CorrelationClustering

Melanie Schmidt, Analysis of Ward’smethod

Salle 43 Network Design and Routing, Chair: Yuko Kuroki, session 346 APPROXBuild C, Z 13rd floor3x30 min

Yusa Matsuda, A 4-approximation algo-rithm for k-prize collecting Steiner treeproblems

Yuko Kuroki, Approximation algorithmfor star-star hub-and-spoke network designproblems

Jeremy Omer, Time-dependent shortestpath with discounted waiting

Salle 41 Variants of the Assignment problem, Organizer: Kavitha Telikepalli, session 266 COMBBuild C, Z 13rd floor3x30 min

Tobias Momke, Approximating Airportsand Railways

Ami Paz, A (2+eps)-Approximation forMaximum Weight Matching in the Semi-Streaming Model

Kavitha Telikepalli, Popularity, MixedMatchings, and Self-duality

Salle 39 Polyhedral aspects of combinatorial optimization problems, Chair: Guillerme Duvillié, session 404 COMBBuild E, Z 13rd floor3x30 min

Shungo Koichi, A polyhedral insight intocovering a 2/3 supermodular function by agraph

Sergei Chubanov, Alternating contractionsand their combinatorial applications

Guillerme Duvillie, Comparison of somesymmetry breaking techniques for graphcoloring problem

29

Room Optimization under Uncertainty - Wednesday 3:15 PM – 4:45 PMSalle 32 Learning and Stochastic Programming, Organizer: Matthias Poloczek, session 254 StochBuild B, Z 5Ground Floor3x30 min

Junyi Liu, Asymptotic Results For Two-stage Stochastic Quadratic Programming

Haoxiang Yang, Optimizing Crashing De-cisions in a Project Management Problemwith Disruptions

Matthias Poloczek, Bayesian Optimiza-tion of Combinatorial Structures

DENIGES Dynamic Optimization: Theory and Algorithms, Organizer: Vineet Goyal, session 100 RobustBuild C, Z 5Ground Floor3x30 min

Shimrit Shtern, A Scalable Algorithm forTwo-Stage Adaptive Linear Optimization

Bradley Sturt, Data-Driven Multi-StageAdaptive Optimization

Vineet Goyal, Optimal Approximation viaAffine Policies for Two-stage Robust Opti-mization

Salle 37 Cursing the Dimensionality: Two-Stage and Multi-Stage Robust Optimization,Organizer: Angelos Tsoukalas, session 443

Robust

Build B, Z 4Intermediate3x30 min

Chin PangHo, Efficient Algorithms for Ro-bust MDPs with State Rectangularity

Frans de Ruiter, Dual approach for two-stage robust nonlinear optimization models

Angelos Tsoukalas, Robust Dual Dy-namic Programming

Salle 31 Dynamic programming applications, Chair: Susanne Hoffmeister, session 379 MarkovBuild B, Z 5Ground Floor2x30 min

Susanne Hoffmeister, Markov DecisionProcesses for Sport Strategy Optimization

Paolo Serafini, A Model to evaluate thecost-effectiveness trade-off for urologictreatments

Salle 30 Nonconvex and Complex Problems in Multiobjective Optimization,Chair: Gabriele Eichfelder, session 268

Game

Build B, Z 5Ground Floor3x30 min

Gabriele Eichfelder, A Trust RegionMethod for Heterogeneous MultiobjectiveOptimization

Elizabeth Karas, Multiobjective program-ming via bundle methods

Tommaso Levato, Sparse multiobjectiveoptimization via concave approximations

30

Room Continuous Optimization - Wednesday 3:15 PM – 4:45 PMGINTRAC The power and limits of the Lasserre hierarchy, Organizer: Markus Schweighofer, session 9 NLPBuild Q, Z 8Ground Floor3x30 min

Standa Zivny, The power and limitsof convex relaxations for general-valuedCSPs

Adam Kurpisz, On the convergence of theLasserre/SoS hierarchy for 0/1 optimiza-tion problems.

Monaldo Mastrolilli, High Degree SOSProofs, Bienstock-Zuckerberg hierarchyand Chvatal-Gomory cuts

Salle 05 Subspace methods in NLP I, Organizer: Michal Kocvara, session 45 NLPBuild Q, Z 111st floor3x30 min

Zaikun Zhang, A Space TransformationFramework for Nonlinear Optimization:Part I

Serge Gratton, A Space TransformationFramework for Nonlinear Optimization:Part II

Francisco Sobral, Quasi-Newton and theUnreduced Matrix in Interior Point Meth-ods

Salle 9 Quadratic Optimization, Chair: Anders Forsgren, session 417 NLPBuild N, Z 124th floor3x30 min

David Ek, On limited-memory quasi-Newton methods for minimizing aquadratic function

Anders Forsgren, On degeneracy inactive-set methods for linear and convexquadratic programming

Fernanda Raupp, An algorithm for project-ing a point onto a level set of a quadraticfunction

Salle 8 Adaptivity in non-smooth optimization, Organizer: Volkan Cevher, session 187 NonSmoothBuild N, Z 124th floor3x30 min

Olivier Fercoq, Adaptive Double LoopSmoothing Algorithms

Kfir Levy, Universal Acceleration throughLearning Rate Adaptation

Stephen Becker, ADMM vs gradientmethods for ill-conditioned imaging prob-lems

Salle 20 SDP approaches to combinatorial and global optimization problems,Organizer: Etienne De Klerk, session 15

SDP

Build G, Z 61st floor3x30 min

Samuel Gutekunst, Semidefinite Pro-gramming Relaxations of the TravelingSalesman Problem

Hao Hu, On Solving the Quadratic Short-est Path Problem.

Ahmadreza Marandi, SDP relaxations ofpolynomial optimization problems withchordal structure

Salle LC5 Reformulation-based solution methods for quadratic programming,Organizer: Dominique Quadri, session 215

SDP

Build L, Z 10Intermediate 13x30 min

Eric Soutil, Non-convex Quadratic Inte-ger Programming : a piecewise lineariza-tion

Hadrien Godard, Solving Alternative Cur-rent Optimal Power Flow to global opti-mality

Sourour Elloumi, Preprocessing and re-formulation for the Quadratic AssignmentProblem

Salle 06 Optimization Algorithms and Variational Inequalities II, Organizer: Xiaoqi Yang, session 150 VariatBuild Q, Z 111st floor3x30 min

Xiaoqi Yang, On Error Bound Moduli forLocally Lipschitz and Regular Functions

Min Li, Inexact primal-dual hybrid gradi-ent methods for saddle-point problems

Kuang Bai, On directional pseudo/quasi-normality and directional enhanced KKTconditions

Salle ARNOZAN Nash equilibrium and games 1, Organizer: Lorenzo Lampariello, session 365 VariatBuild Q, Z 8Ground Floor3x30 min

Anna Thunen, Solving Multi-Leader-Follower Games

Jacqueline Morgan, Nash equilibrium:uniqueness and approximation via contin-uous optimization

Mauro Passacantando, Fixed point and ex-tragradient algorithms for quasi-equilibria

Salle KC6 Fast Converging Stochastic Optimization Algorithms, Organizer: Francis Bach, session 213 RandomMBuild K, Z 10Intermediate 13x30 min

Aymeric Dieuleveut, Bridging the Gapbetween Constant Step Size SGD andMarkov Chains

AudeGenevay, Stochastic Optimization forLarge Scale Optimal Transport

Robert Gower, Variance Reduced Meth-ods via Sketching

Salle 21 Surrogate-based algorithms for constrained derivative-free problems,Chair: Phillipe R. Sampaio, session 126

DerFree

Build G, Z 6Intermediate3x30 min

Manuel Ramos-Castillo, Optimal agri-cultural scheduling through MINLPsurrogate-based optimization

Phillipe Sampaio, A global optimizationalgorithm for derivative-free constrainedproblems

Geovani Grapiglia, Derivative-Free Trust-Region Algorithms for L1, Minimax andBi-Objective Optimiz

Salle AURIAC Risk-Averse PDE-Constrained Optimization–Methods and Applications,Organizer: Harbir Antil, session 222

Control

Build G, Z 61st floor3x30 min

Ruediger Schultz, Stochastic Dominancein Elastic Shape Optimization

Harbir Antil, Weighted Sobolev Spaceswith Application to Image Processing

Drew Kouri, Smoothing Techniques forRisk-Averse PDE-Constrained Optimiza-tion

31

Room Specific Models, Algorithms, and Software - Wednesday 3:15 PM – 4:45 PMSalle DENUCE Second order methods for training ML models, Chair: Julien Mairal, session 474 LearningBuild Q, Z 8Ground Floor3x30 min

Amir Abdessamad, Newton method withan adjusted generalized Hessian matrix forSVMs

Julien Mairal, A Variable Metric Inex-act Proximal Point Algorithm for Quasi-Newton Acceleration

Robert Mohr, An Adaptive Sample SizeTrust-Region Method for Empirical RiskMinimization

FABRE Convex optimization, distances and constraints, Chair: Pablo A Parrilo, session 476 LearningBuild J, Z 8Ground Floor3x30 min

Pavel Dvurechensky, Computational Opti-mal Transport: Accelerated Gradient De-scent vs Sinkhorn

Pablo Parrilo, Geodesic distance maxi-mization

Adil Salim, A Splitting Algorithm forMinimization under Stochastic LinearConstraints

Salle 16 Rail and Maritime Transportation, Chair: Kazuhiro Kobayashi, session 454 LogisticsBuild I, Z 72nd floor3x30 min

Kazuhiro Kobayashi, Accelerated columngeneration for a ship routing problem withspeed optimization

Stanley Schade, Column Generation inRailway Optimization

Tatsuki Yamauchi, Optimizing Train Stop-ping Patterns for Congestion Management

Salle 18 Scheduling in Networks, Chair: Hamish Waterer, session 532 SchedulingBuild I, Z 71st floor3x30 min

Gratien Bonvin, Global optimization forthe pump scheduling problem in drinkingwater networks

Amadeu Coco, Addressing a schedulingproblem for planned disruptions on urbanroad networks

Hamish Waterer, Scheduling of mainte-nance windows in a mining supply chainrailway network

Salle 23 Conic Optimization and Power Systems, Organizer: Jakub Marecek, session 68 EnergyBuild G, Z 63rd floor3x30 min

Arvind Raghunathan, Degeneracy inChordal Decomposition of SemidefinitePrograms

Jakub Marecek, When to switch from aconvex relaxation to Newton’s method onthe non-convex POP

Konstantin Turitsyn, Convex restrictionsof power flow feasibility sets

Salle 24 Emerging Energy Markets, Organizer: Dennice F. Gayme, session 291 EnergyBuild G, Z 63rd floor2x30 min

Maryam Kamgarpour, Designingcoalition-proof mechanisms - the caseof electricity markets

Sean Meyn, Irrational Agents and thePower Grid

Salle LA4 Air Transportation and Air Traffic Management, Organizer: Sonia Cafieri, session 315 SciencesBuild L, Z 8Basement3x30 min

Ahmed Khassiba, A two-stage stochasticmodel for scheduling aircraft arrivals un-der uncertainty

Fernando Dias, Aircraft conflict resolutionand heading recovery with mixed-integerprogramming

Sonia Cafieri, MINLP for aircraft conflictavoidance via speed and heading angle de-viations

PITRES Progress in Conic and MIP Solvers, Organizer: Imre Polik, session 237 AlgoBuild O, Z 8Ground Floor3x30 min

Jean-Hubert Hours, Artelys Knitro 11.0, anew conic solver and other novelties

Erling Andersen, MOSEK version 9 FranzWesselmann, Recent enhancementsin MATLAB Optimization Toolbox solversfor LP and MILP

Salle 22 Structure Detection in Integer Programming, Organizer: Taghi Khaniyev, session 272 AlgoBuild G, Z 62nd floor3x30 min

Taghi Khaniyev, Automatic structure de-tection in mixed integer programs

Michael Bastubbe, Modular Detection ofModel Structure in Integer Programming

Jonas Witt, A Computational Investiga-tion on Generic Cutting Planes in Branch-Price-and-Cut

32

Room Invited Talks - Wednesday 3:15 PM – 4:45 PMSIGALAS Logistics, Chair: Frieder Smolny, session 388 INTERFACEBuild C, Z 22nd floor3x30 min

KajHolmberg, Using OpenStreetMap datafor route optimization: extraction and re-duction

Gwenael Rault, Modeling the PeriodicVehicle Routing Problem in an industrialcontext

Frieder Smolny, Multiscale optimizationof logistics networks

33

Room Discrete Optimization & Integer Programming - Wednesday 5:00 PM – 6:30 PMSalle 43 IP-Formulations, Chair: Temitayo Ajayi, session 516 IPtheoryBuild C, Z 13rd floor2x30 min

Wolfgang Riedl, The quadratic assign-ment problem: a comparison of two lin-earizations

Temitayo Ajayi, Assessing ParametrizedLinear Programming Relaxations With Su-peradditive Duality

Salle 44 Exact Approaches for Vehicle Routing and Variants, Organizer: Ricardo Fukasawa, session 288 IPpracticeBuild C, Z 13rd floor3x30 min

Ricardo Fukasawa, The Capacitated Vehi-cle Routing Problem with Stochastic De-mands

Claudio Contardo, Efficient metaheuristicpricing in vehicle routing

Rafael Martinelli, Exact Solution of aClass of Vehicle Scheduling Problems

DURKHEIM MINLP (III), Organizer: Daniel Bienstock, session 67 MINLPBuild A, Z 13rd floor3x30 min

Alberto Del Pia, Cardinality-constrainedlinear regression with sparse matrices

Guanyi Wang, Computational evaluationof new dual bounding techniques for sparsePCA

Jeff Linderoth, Cutting Planes for Lin-ear Programs with Complementarity Con-straints

Salle 34 Robust Approaches for Challenging Uncertain Optimization Problems,Organizer: Frauke Liers, session 124

MINLP

Build B, Z 31st floor3x30 min

Timo Gersing, A New Approach for Ex-tending Cover Inequalities for the RobustKnapsack Polytope

Andreas Schmitt, An Interdiction Ap-proach for the Design of High-Rise WaterSupply Systems

Sebastian Tschuppik, Robust optimizationwith selected scenarios

Salle 35 Advances in MINLP, Organizer: Laura Palagi, session 165 MINLPBuild B, Z 4Intermediate3x30 min

Marianna De Santis, An Active Set Algo-rithm for Robust Combinatorial Optimiza-tion

Veronica Piccialli, Membrane System De-sign Optimization

Emiliano Traversi, Dantzig Wolfe Decom-position for Binary Quadratic Program-ming

LEYTEIRE Approximation Algorithms for Geometric Packing Problems, Organizer: Fabrizio Grandoni, session 28 APPROXBuild E, Z 13rd floor3x30 min

Fabrizio Grandoni, Approximating Geo-metric Knapsack via L-Packings

Andreas Wiese, Parameterized (1+eps)-approximation algorithms for packingproblems

Klaus Jansen, Closing the gap for pseudo-polynomial strip packing

Salle 36 Online Optimization, Organizer: Kevin Schewior, session 35 APPROXBuild B, Z 4Intermediate3x30 min

VictorVerdugo, How large is your graph? Andreas Tonnis, Submodular SecretaryProblems: Cardinality, Matching, and Lin-ear Constraints

Kevin Schewior, Tight Competitive Anal-ysis for Online TSP on the Line

Salle 41 Connectivity problems and Steiner trees, Chair: Andreas E Feldmann, session 421 COMBBuild C, Z 13rd floor4x20 min

Marcus Brazil, Computing minimum 2-connected Steiner networks in the Eu-clidean plane

Yasuko Matsui, Enumerating All Span-ning Subgraphs with Edge-Connectivity atLeast k

Mark Turner, The variable-cost node-weighted Steiner tree problem in the Eu-clidean plane.

Andreas Feldmann, Parameterized Ap-proximation Algorithms for BidirectedSteiner Network Problems

Salle 39 Shortest paths and cutting stock, Chair: Arnaud Vandaele, session 426 COMBBuild E, Z 13rd floor4x20 min

Pedro de las Casas, Cost Projection Meth-ods for the Shortest Path Problem withCrossing Costs

Adam Schienle, Solving the Time-Dependent Shortest Path Problem usingSuper-Optimal Wind

Miriam Schloter, Earliest Arrival Trans-shipments in Networks With MultipleSinks

Arnaud Vandaele, One-dimensional cut-ting stock instances for which few patternsare needed

34

Room Optimization under Uncertainty - Wednesday 5:00 PM – 6:30 PMDENIGES Stochastic Programming and Distributionally Robust Optimization Models with Endogenous

Uncertainty, Organizer: Miguel Lejeune, session 248Stoch

Build C, Z 5Ground Floor3x30 min

Nilay Noyan, Distributionally Robust Op-timization with Decision-Dependent Am-biguity Set

Kartikey Sharma, Optimization UnderDecision-dependent Uncertainty

Miguel Lejeune, Chance-Constrained Op-timization Models with Endogenous andExogenous Uncertainty

Salle 32 Stochastic optimization models and applications, Chair: F.-Javier Heredia, session 495 StochBuild B, Z 5Ground Floor4x20 min

Geoffrey Oxberry, Design optimizationunder uncertainty

Gislaine Pericaro, Optimal non-anticipative scenarios for nonlinearhydrothermal power systems

AlexanderVinel, A Generalized Risk Par-ity Model with Application for HazmatTransportation

F.-Javier Heredia, A multistage stochasticprogramming model for the optimal bid ofa wind producer

Salle 37 Robust Adaptive Control and Learning, Organizer: Siqian Shen, session 97 RobustBuild B, Z 4Intermediate2x30 min

Siqian Shen, Distributionally RobustAdaptive Control under NonstationaryUncertainty

Lauren Steimle, Leveraging stochasticprogramming to design robust policies forMarkov decision

Salle 33 Robust combinatorial optimization III, Organizer: Moritz Mühlenthaler, session 255 RobustBuild B, Z 5Ground Floor4x20 min

Moritz Muhlenthaler, Robust MatchingAugmentation

Viktor Bindewald, Solving Bulk-RobustAssignment Problems to Optimality

Felix Hommelsheim, Assignment Problemswith few Failure Resources

Jaehyeon Ryu, Distributionally RobustChance-Constrained Binary KnapsackProblem

Salle 30 Aspects of Multiobjective Combinatorial Optimization, Organizer: Matthias Ehrgott, session 87 GameBuild B, Z 5Ground Floor3x30 min

Serpil Sayin, Generating RepresentativeSets for Multiobjective Discrete Optimiza-tion Problems

KimAndersen, A multi-objective approachto sensitivity analysis of MILP

Fritz Bokler, Approximating the Multi-objective Shortest Path Problem in Practice

35

Room Continuous Optimization - Wednesday 5:00 PM – 6:30 PMGINTRAC Software for Nonlinear Optimization, Organizer: Sven Leyffer, session 133 NLPBuild Q, Z 8Ground Floor3x30 min

Charlie Vanaret, Argonot: An Open-Source Software Framework for NonlinearOptimization

Philip Gill, A Primal-Dual Shifted BarrierMethod for Nonlinear Optimization

Elizabeth Wong, L-RH-B: Softwarefor Large-Scale Bound-ConstrainedOptimization

Salle 05 Conjugate Gradient Methods, Chair: Giovanni Fasano, session 362 NLPBuild Q, Z 111st floor3x30 min

Mehiddin Al-Baali, A New Diagonaliz-able Conjugate Gradient Method for Un-constrained Optimization

Giovanni Fasano, Conjugate DirectionMethods and Polarity for Quadratic Hyper-surfaces

Luis Lucambio Perez, Non-linear conju-gate gradient for vector optimization onRiemannian manifolds

Salle 9 Linear Optimization II, Chair: Julian Hall, session 416 NLPBuild N, Z 124th floor3x30 min

Julian Hall, Starting the dual revised sim-plex method from an advanced basis

Masaya Tano, On the number of simplexiterations of the steepest-edge for a nonde-generate LP

Marina Epelman, New Results on the Sim-plex Method for Minimum Cost Flows inInfinite Networks

Salle ARNOZAN Interior Point Methods in LP and NLP, Chair: Andre L Tits, session 430 NLPBuild Q, Z 8Ground Floor3x30 min

Andre Tits, Constraint-Reduced MPC forCQP, with a Modified Active Set Identifi-cation Scheme

Thiane Coliboro, An IPM approach for atime dependent large-scale assortment al-location problem

Ngoc Nguyen Tran, Local analysis of aprimal-dual method for NLP without con-straint qualification

Salle 8 Methods and Analysis for Nonsmooth Optimization, Organizer: Michael L Overton, session 86 NonSmoothBuild N, Z 124th floor3x30 min

Michael Overton, Partial Smoothness ofthe Numerical Radius

Adrian Lewis, Partial smoothness and ac-tive sets: a fresh approach

Dmitriy Drusvyatskiy, Subgradient meth-ods for sharp weakly convex problems

Salle 20 Noncommutative polynomial optimization: semidefinite relaxations, free convexity and applications toquantum information I, Organizer: Monique Laurent, session 20

SDP

Build G, Z 61st floor3x30 min

Markus Schweighofer, Inclusion of spec-trahedra, free spectrahedra and coin toss-ing

Tom-Lukas Kriel, Matrix convex sets andmatrix extreme points

Janez Povh, Extracting optimisers by non-commutative GNS construction is robust

Salle LC5 Completely Positive Cones and Applications, Chair: Patrick Groetzner, session 464 SDPBuild L, Z 10Intermediate 14x20 min

Muhammad Iqbal, Approximation Hierar-chies for Copositive and Completely Posi-tive Tensor Cones

Mina Saee Bostanabad, Inner approximat-ing the completely positive cone via thecone of SDD matrices

Ellen Fukuda, Solving nonlinear conicprogramming problems with a new DC ap-proach

Patrick Groetzner, A method to computefactorizations for completely positive ma-trices

Salle 06 Complementarity Problems, Organizer: Samir K. Neogy, session 173 VariatBuild Q, Z 111st floor3x30 min

Muddappa Gowda, Weakly homogeneousvariational inequalities

Samir Neogy, On testing matrices withnonnegative principal minors

Dipti Dubey, Total Dual Integrality and In-tegral Solutions of Linear Complementar-ity Problem

Salle KC6 Non-Convex and Second-order Methods in Machine Learning, Organizer: Martin Takac, session 33 RandomMBuild K, Z 10Intermediate 14x20 min

Aurelien Lucchi, Escaping Saddles withStochastic Algorithms

Reza Babanezhad, Convergence Rate ofExpectation-Maximization

Francesco Orabona, Parameter-free non-smooth convex stochastic optimizationthrough coin betting

Martin Takac, SGD and Hogwild! Con-vergence Without the Bounded GradientsAssumption

Salle 21 Progress in methods and theory of derivative-free optimization, Chair: Serge Gratton, session 42 DerFreeBuild G, Z 6Intermediate3x30 min

Charles Audet, Mesh-based Nelder-Meadalgorithm for inequality constrained opti-mization

Jeffrey Larson, Manifold Sampling forNonconvex Optimization of PiecewiseLinear Compositions

Morteza Kimiaei, Competitive derivative-free optimization with optimal complexity

Salle AURIAC Advances in optimization methods for time dependent problems II, Organizer: Denis Ridzal, session 225 ControlBuild G, Z 61st floor4x20 min

Stefan Ulbrich, Preconditioners for un-steady PDE-constrained optimization andparallel variants

Sebastian Goetschel, Parallel-in-timePDE-constrained optimization usingPFASST

Andreas Potschka, Direct Multiple Shoot-ing for parabolic PDE constrained opti-mization

Denis Ridzal, Multigrid-in-time methodsfor optimization with nonlinear PDE/DAEconstraints

36

Room Specific Models, Algorithms, and Software - Wednesday 5:00 PM – 6:30 PMFABRE Problems in the intersection of machine learning and optimization, Chair: Ross M Anderson, session 328 LearningBuild J, Z 8Ground Floor3x30 min

Brandon Amos, OptNet: End-to-End Dif-ferentiable Constrained Optimization

Ross Anderson, Solving argmax for a neu-ral network with MIP, and related opti-mization problems

Vinod Nair, Learning Fast Optimizers forContextual Stochastic Integer Programs

Salle 22 Large-scale convex optimization, Chair: Alexander V. Rogozin, session 479 LearningBuild G, Z 62nd floor2x20 min

Alexander Rogozin, Optimal distributedconvex optimization on slowly time-varying graphs

Tommaso Colombo, Leverage data struc-ture to improve Stochastic Gradient De-scent algorithm

Salle 24 Location and Routing, Chair: Mustapha Oudani, session 451 LogisticsBuild G, Z 63rd floor4x20 min

Imen Ben Mohamed, Stochastic Two-echelon Location-Routing

Rasul Esmaeilbeigi, Benders decomposi-tion for a hierarchical facility locationproblem

Nicolas Kammerling, Benders Decompo-sition for Uncertain Hub Location withVariable Allocation

Mustapha Oudani, The Incomplete HubLocation and Routing Problem

Salle 16 Production-Routing, Chair: Feng Gao, session 456 LogisticsBuild I, Z 72nd floor3x20 min

Feng Gao, Models and Algorithms for Ro-bust Production Routing Under DemandUncertainty

Saranthorn Phusingha, Meta-Heuristicsfor Multi-Period Sales Districting Problem

Yuzhuo Qiu, Models and Algorithms forStochastic and Robust Production Routingwith Time Win

Salle 18 Machine Scheduling 2, Chair: Guopeng Song, session 529 SchedulingBuild I, Z 71st floor3x20 min

Cristiane Ferreira, Human-RobotScheduling in Collaborative Environments

Margaux Nattaf, Parallel machinescheduling with time constraints onmachine qualifications

Guopeng Song, The robust machine avail-ability problem

Salle DENUCE Optimization and modeling of integrated energy systems, Organizer: Jalal Kazempour, session 71 EnergyBuild Q, Z 8Ground Floor4x20 min

Stefanos Delikaraoglou, Market-basedvaluation of natural gas network flexibility

Ibrahim Abada, Unintended consequences:The snowball effect of energy communities

Lesia Mitridati, Coordination of Heatand Electricity Systems via Market-BasedMechanisms

Anna Schwele, Virtual bidders and self-schedulers in electricity and natural gasmarkets

Salle 23 Energy Market Models, Chair: Sauleh A Siddiqui, session 522 EnergyBuild G, Z 63rd floor3x30 min

Thomas Kleinert, Global Optimization ofMultilevel Electricity Market Models

Emre Celebi, Co-optimization Modelswith Market-Clearing Equilibrium: A Ro-bust Approach

Sauleh Siddiqui, Solving Problems withEquilibrium Constraints Applied to EnergyMarkets

Salle LA4 Resource-constrained assignment and scheduling, Organizer: Fabian Bastin, session 398 SciencesBuild L, Z 8Basement3x30 min

Giorgio Sartor, A novel formulation forjob-shop scheduling in traffic management

Vipin Vijayalakshmi, Improving localsearch for distributed resource allocationand equilibrium.

Fabian Bastin, A learning-based approachfor multi-skill staffing optimization in callcenters

PITRES Progress in MIP Solvers II, Organizer: Hans Mittelmann, session 234 AlgoBuild O, Z 8Ground Floor3x30 min

Andrea Tramontani, Benders Decomposi-tion in IBM CPLEX

Michael Winkler, Gurobi 8.0 - What’snew

Michael Perregaard, Recent Progress inthe Xpress Solvers

37

Room Invited Talks - Wednesday 5:00 PM – 6:30 PMSIGALAS Solvers and softwares, Chair: François Clautiaux, session 390 INTERFACEBuild C, Z 22nd floor4x20 min

Julien Darlay, Solving packing, rout-ing and scheduling problems using Local-Solver

Pawel Lichocki, Applied mixed integerprogramming: The why and how

Robert Luce, Solving MIPs with GurobiInstant Cloud

Johannes Muller, Creating an optimiza-tion web app with FICO Xpress

38

Room Discrete Optimization & Integer Programming - Thursday 8:30 AM – 10:30 AMSalle 34 Integer linear programming, convex geometry, and lattices , Organizer: Sinai Robins, session 142 IPtheoryBuild B, Z 31st floor4x30 min

Achill Schurmann, Exploiting LinearSymmetries in Integer Convex Optimiza-tion

Matthias Schymura, On the reverse isodi-ametric problem

Kevin Woods, The Complexity of Pres-burger Arithmetic in Fixed Dimension

Sinai Robins, Fourier transforms of poly-topes, solid angle sums, and discrete vol-umes

Salle 35 Convexity and Polytopes, Chair: David Warme, session 518 IPtheoryBuild B, Z 4Intermediate4x30 min

Emiliano Lancini, Box-Total Dual Integral-ity and k-Edge-Connectivity

Tamon Stephen, On the Circuit DiameterConjecture

Filipe Cabral, The role of extreme pointsfor convex hull operations.

David Warme, Metrics for Strength of In-equalities with Respect to a Polytope

Salle 44 Advanced Linear(ized) MIP Formulations for Zero-One Programs, Organizer: Sven Mallach, session 127 IPpracticeBuild C, Z 13rd floor4x30 min

Leon Eifler, Mixed-Integer Programmingfor Clustering in Non-reversible MarkovProcesses

Adalat Jabrayilov, A new ILP for theSteiner Tree Problem with Revenues, Bud-get and Hop Constraints

Daniel Schmidt, An extended formulationfor the Steiner Forest Problem

Sven Mallach, Compact Linearization forZero-One Quadratic Programs

LEYTEIRE Submodular Maximization, Organizer: Moran Feldman, session 29 APPROXBuild E, Z 13rd floor4x30 min

Moran Feldman, Deterministic and Com-binatorial Algorithms for SubmodularMaximization

Baruch Schieber, Constrained Submodu-lar Maximization via Greedy Local Search

Simon Bruggmann, Submodular Maxi-mization through the Lens of Linear Pro-gramming

Niv Buchbinder, Constrained SubmodularMaximization via a Non-symmetric Tech-nique

Salle 43 Cycles and Trees, Organizer: Tobias Mömke, session 90 APPROXBuild C, Z 13rd floor4x30 min

Alantha Newman, Coloring and Dominat-ing Set on Digraphs with Bounded Inde-pendence Number

Antonios Antoniadis, A PTAS for TSPwith Hyperplane Neighborhoods

Laszlo Kozma, Maximum Scatter TSP indoubling metrics

Ralf Klasing, Approximabilty of Hub Al-location Problems

Salle 36 Bin Packing, Chair: Frits CR Spieksma, session 344 APPROXBuild B, Z 4Intermediate4x30 min

Nadia Brauner, Automatically computedbounds for the online bin stretching prob-lem

Leah Epstein, Batched bin packing Shlomo Karhi, Online Packing of Arbi-trary Size Items into Designated and Mul-tipurpose Bins

Frits Spieksma, Partitioning Vectors intoQuadruples

Salle 41 Graphs and clutters, Organizer: Gerard Cornuejols, session 263 COMBBuild C, Z 13rd floor4x30 min

Guoli Ding, Packing cycles in a tourna-ment

Sharat Ibrahimpur, Min-Max Theoremsfor Packing and Covering Odd (u,v)-trails

Ahmad Abdi, Cuboids, a class of clutters Dabeen Lee, Deltas, extended odd holesand their blockers

Salle 39 Graph theory, Chair: Thomas Bellitto, session 422 COMBBuild E, Z 13rd floor4x30 min

IsabelBeckenbach, A Tight Cut Decompo-sition for Hypergraphs with Perfect Match-ings

Xujin Chen, Densities, Matchings, andFractional Edge-Colorings

Yutaro Yamaguchi, Making BipartiteGraphs DM-irreducible

Thomas Bellitto, Optimal weighting tominimize the independence ratio of a graph

DURKHEIM Parallel Computing and Sustainability, Organizer: Bistra Dilkina, session 296 CPBuild A, Z 13rd floor4x30 min

Fei Fang, Designing the game to play in se-curity and sustainability domains

Nahid Jafari, A Robust OptimizationModel for an Invasive Species Manage-ment Problem

Salvador Abreu, Parallel HYbridizationfor Simple Heuristics

CiaranMcCreesh, Parallel Search, Order-ing, Reproducibility, and Scalability

Salle 47 Performance Analysis, Organizer: Charlotte Truchet, session 298 CPBuild A, Z 13rd floor4x30 min

Lars Kotthoff, The Shapley Value andthe Temporal Shapley Value for AlgorithmAnalysis

Guilhem Semerjian, Phase transitions inrandom constraint satisfaction problems

Charlotte Truchet, A probabilistic studyof the propagation of the AllDifferent con-straint

Alexander Tesch, Improving EnergeticPropagations for Cumulative Scheduling

39

Room Optimization under Uncertainty - Thursday 8:30 AM – 10:30 AMDENIGES New results in chance-constrained optimization, Chair: Bismark Singh, session 489 StochBuild C, Z 5Ground Floor4x30 min

Abebe Geletu, Smoothing Methods forChance Constrained Optimization of Ellip-tic PDE Systems

Rene Henrion, Dynamic chance con-straints under random distributiond

Armin Hoffmann, Differentiabilty of jointchance constraints under weakened LICQ

Bismark Singh, Approximating ChanceConstrained Programs using Classical In-equalities

Salle 32 Topics in multistage and integer stochastic optimization, Organizer: Jim Luedtke, session 490 StochBuild B, Z 5Ground Floor4x30 min

Ozge Safak, Three-Stage Stochastic Air-line Scheduling Problem

Mehdi Karimi-Nasab, State space analysisof a stochastic DP to deal with curse of di-mensionality

Cong Han Lim, Partitioned SubgradientMethods for Stochastic Mixed Integer Pro-gram duals

Jim Luedtke, Lagrangian dual decisionrules for multistage stochastic integer pro-grams

Salle 37 K-adaptability, Organizer: Anirudh Subramanyam, session 1 RobustBuild B, Z 4Intermediate4x30 min

Jannis Kurtz, Min-max-min Robust Opti-mization for the Capacitated Vehicle Rout-ing Problem

Michael Poss, Min-Max-Min Robustnessfor Combinatorial Problems with Bud-geted Uncertainty

Jonas Pruente, K-Adaptibility in Stochas-tic Programming

Anirudh Subramanyam, K-Adaptability inTwo-Stage Mixed-Integer Robust Opti-mization

Salle 33 New applications of robust optimizations, Chair: Mirjam Duer, session 461 RobustBuild B, Z 5Ground Floor3x30 min

Jorge Vera, Condition and geometricmeasures for consistency in intertemporaloptimization

Alec Koppel, Compositional StochasticOptimization with Kernels for Robust On-line Learning

Mirjam Duer, Robust Approach for Strati-fied Sampling Allocation Problems

Salle 30 Stackelberg Games, Chair: Stefano Coniglio, session 374 GameBuild B, Z 5Ground Floor4x30 min

Jean-Bernard Eytard, Tropical geometryapplied to bilevel programming

Stefan Waldherr, Bilevel Programmingfor Combinatorial Exchanges with BudgetConstraints

Stefano Coniglio, Computing PessimisticLeader-Follower Equilibria with MultipleFollowers

Francesco Caruso, A learning approachfor selection of subgame perfect Nashequilibria

40

Room Continuous Optimization - Thursday 8:30 AM – 10:30 AMSalle ARNOZAN First-order methods: advances and applications, Organizer: Immanuel M. Bomze, session 3 NLPBuild Q, Z 8Ground Floor4x30 min

Axel Boehm, Incremental mirror descentwith random sweeping and a proximal step

Immanuel Bomze, Active-set identificationin Frank-Wolfe variants on the standardsimplex

Michael Kahr, Robust StQP, first-ordermethods, and applications in social net-work analysis

Mathias Staudigl, On the convergence ofprojection free Hessian Barrier-GradientAlgorithms

GINTRAC Recent advances in interior point methods and NLP, Organizer: Michael Todd, session 77 NLPBuild Q, Z 8Ground Floor4x30 min

Michael Todd, The ellipsoid method redux E. Alper Yildirim, MILP Formulationsfor Globally Solving Nonconvex StandardQuadratic Programs

Yinyu Ye, A One-phase Interior PointMethod For Nonconvex Optimization

Oliver Hinder, A polynomial time interiorpoint method for problems with nonconvexconstraints

Salle 05 Machine learning for optimisation, Organizer: Coralia Cartis, session 176 NLPBuild Q, Z 111st floor4x30 min

Adilet Otemissov, Dimensionality reduc-tion for global optimisation: adaptive ran-dom embeddings

Coralia Cartis, Stochastic trust-regionwith global rate to second-order criticality

Radu Baltean-Lugojan, Online generationvia offline selection of strong linear cutsfrom QP SDP relax.

Boris Houska, Global optimization inHilbert Space

Salle KC7 First Order Methods I, Chair: Sandra A. Santos, session 436 NLPBuild K, Z 10Intermediate 24x30 min

Sandra Santos, Accelerating block coor-dinate descent methods with identificationstrategies

Francesco Locatello, On Matching Pur-suit and Coordinate Descent

Tianyi Lin, A Unified Scheme to Accel-erate Adaptive Cubic Regularization andGradient Method

Felix Lieder, Performance Estimation forFixed Point Iterations

Salle LC4 Universal methods in non-smooth analysis, Organizer: Alexander Gasnikov, session 53 NonSmoothBuild L, Z 9Intermediate 14x30 min

Alexander Tyurin, Universal Nesterov’sgradient method in general model concep-tion

Sergey Guminov, Dual universal conjugategradient type methods.

Alexander Tytov, Universal ProximalMethod for Variational Inequalities

Dmitry Kamzolov, Universal Intermedi-ate Gradient Method for Convex Problemswith Inexact Oracle

Salle 8 First-order methods for nonconvex and pathological convex problems, Organizer: Wotao Yin, session 183 NonSmoothBuild N, Z 124th floor4x30 min

Mila Nikolova, Alternating structure-adapted proximal gradient descent for non-convex problems

Wenbo Gao, ADMM for Multiaffine Con-strained Optimization

Ernest Ryu, Douglas-Rachford Splittingfor Pathological Convex Optimization

Wotao Yin, Polynomial-Time Run-and-Inspect Method for Certain NonconvexOptimization

Salle 9 Non smooth optimization for lage scale poblems, Organizer: Yu Du, session 556 NonSmoothBuild N, Z 124th floor4x30 min

Yu Du, Selective Linearization for Multi-block Statistical Learning Problems

Dmitry Grishchenko, Randomized Proxi-mal Algorithm with Automatic DimensionReduction.

Shummin Nakayama, Inexact proximalmemoryless spectral-scaling MBFGSmethod

Min Tao, Decomposition methods for com-puting d-stationary solutions for noncon-vex problem

Salle 20 Computer-assisted analyses of optimization algorithms I, Organizer: Adrien Taylor, session 19 SDPBuild G, Z 61st floor4x30 min

Yoel Drori, Efficient First-order Methodsfor Convex Minimization: A ConstructiveApproach

Donghwan Kim, Optimized first-ordermethod for decreasing gradient of smoothconvex functions

Bryan Van Scoy, The Fastest Known First-Order Method for Smooth Strongly Con-vex Minimization

Laurent Lessard, Analysis of First-OrderAlgorithms for Distributed Optimization

Salle LC5 Geometry and duality in convex optimization, Organizer: Javier F Pena, session 160 SDPBuild L, Z 10Intermediate 14x30 min

David Gutman, Condition Numbers forConvex Functions with Polytope Domains

Javier Pena, Conditioning of conic systemsvia the Grassmannian manifold

Jourdain Lamperski, Solving linear in-equalities via non-convex optimization

Gabor Pataki, On positive duality gaps insemidefinite programming

Salle 06 Nonlinear Optimization and Variational Inequalities I, Organizer: Xin Liu, session 140 VariatBuild Q, Z 111st floor4x30 min

Yaxiang Yuan, Theory and Applicaiton ofp-regularized subproblem with p > 2

Jinyan Fan, A semidefinite relaxation algo-rithm for polynomial equations

Cong Sun, On a special robust optimiza-tion problem

Liang Zhao, Limited memory algorithmswith cubic regularization

Salle KC6 Recent Advances on Stochastic Algorithms and Machine Learning, Organizer: Shiqian Ma, session 202 RandomMBuild K, Z 10Intermediate 14x30 min

Qihang Lin, Level-Set Methods for Finite-Sum Constrained Convex Optimization

Xudong Li, Estimation of Markov Chainvia Rank-constrained Likelihood

Guanghui Lan, Random gradient extrapo-lation for distributed and stochastic opti-mization

Renbo Zhao, An Accelerated Algorithmfor Stochastic Three-composite Optimiza-tion

Salle 21 Bayesian and Randomized Optimization I, Chair: Stefan M Wild, session 39 DerFreeBuild G, Z 6Intermediate4x30 min

Mickael Binois, Improving Bayesian opti-mization via random embeddings

Saul Toscano-Palmerin, Bayesian Opti-mization of Expensive Integrands

Clement Royer, Using Models in Allocateand Partition Algorithms

Youssef Diouane, A Rigorous Frameworkfor Efficient Global Optimization

Salle AURIAC Optimal Control of Variational Inequalities and Complementarity Systems,Chair: Alexandre Vieira, session 336

Control

Build G, Z 61st floor4x30 min

Alexandre Vieira, Optimal control of Lin-ear Complementarity Systems

Anne-Therese Rauls, Computing a Sub-gradient for the Solution Operator of theObstacle Problem

Ailyn Stotzner, Optimal Control of Ther-moviscoplasticity

Anna Walter, Optimal Control of Elasto-plasticity Problems with Finite Deforma-tions

41

Room Specific Models, Algorithms, and Software - Thursday 8:30 AM – 10:30 AMFABRE First-order methods for large-scale convex problems, Organizer: Stephen A Vavasis, session 316 LearningBuild J, Z 8Ground Floor4x30 min

StephenVavasis, A single potential govern-ing convergence of CG, AG and GeometricDescent

Mert Gurbuzbalaban, Robust AcceleratedGradient Method

Peter Richtarik, Randomized methods forconvex feasibility problems and applica-tions to ML

Yaoliang Yu, Bregman Divergence forStochastic Variance Reduction

Salle DENUCE Large-scale learning, Organizer: Lorenzo Rosasco, session 335 LearningBuild Q, Z 8Ground Floor4x30 min

Mikhail Belkin, The power of interpola-tion: on the effectiveness of SGD in mod-ern learning

Chris Re, Precision on the Brain: Low-Precision to High-Precision for MachineLearning

Gergely Neu, Iterate averaging as regular-ization for stochastic gradient descent

Lorenzo Rosasco, Convergence vs stabil-ity: a regularization view on acceleratedmethods

Salle 16 Dynamical systems, control and optimization, Chair: Benjamin Recht, session 470 LearningBuild I, Z 72nd floor4x30 min

Fredrik Bagge Carlson, Tangent SpaceRegularization for Neural-Networks Mod-els of Dynamical Systems

BenjaminRecht, The sample complexity ofiteratively learning to control

Nikolai Matni, Optimization-based adap-tive control using a system level approach.

AshiaWilson, Lyapunov arguments in op-timization

Salle LA4 Multi-commodity flows, Organizer: Ralf Borndörfer, session 358 NetworkBuild L, Z 8Basement4x30 min

Daniel Granot, Monotonicity and confor-mality in multicommodity network-flowproblems

Eduardo Moreno, An exact method basedon adaptive partitions for the StochasticFixed-Charge MCF

Stefano Gualandi, Approximate Wasser-stein Distances of order 1 between images

Ralf Borndorfer, Metric Inequalities forRoutings on Direct Connections in LinePlanning

PITRES Vehicle Routing I, Chair: Guy Desaulniers, session 411 LogisticsBuild O, Z 8Ground Floor3x30 min

Guy Desaulniers, The vehicle routingproblem with stochastic and correlatedtravel times

Bolor Jargalsaikhan, An exact formula-tion for pickup and delivery problem withdivisible split-ups

Mathias Klapp, Branch-and-Price forProbabilistic Vehicle Routing

Salle 23 Unit Commitment Problem and Applications, Organizer: Tiziano Parriani, session 94 EnergyBuild G, Z 63rd floor4x30 min

Allegra De Filippo, Off-line/on-line opti-mization under uncertainty on energy man-agement

Dimitri Thomopulos, A Constrained Short-est Path formulation for the Hydro UnitCommitment Problem

Rafael Lobato, Stochastic HydrothermalUnit Commitment via Multi-level ScenarioTrees

Tiziano Parriani, CHP Systems Optimiza-tion in Presence of Time Binding Con-straints

Salle 24 Mining Applications, Organizer: Alexandra M Newman, session 172 EnergyBuild G, Z 63rd floor4x30 min

Marcos Goycoolea, Lane’s Algorithm Re-visisted

Peter Malkin, A MILP-based approachfor loader assignment in open pit schedul-ing

Levente Sipeki, Optimal Selection of Sup-port Pillars in an Underground Mine

Alexandra Newman, Mathematical Meth-ods for Complex Underground Design andScheduling Problems

Salle 22 Numerically Efficient Methods for Piecewise Algorithmic Differentiation II,Organizer: Torsten F Bosse, session 270

Algo

Build G, Z 62nd floor4x30 min

Laurent Hascoet, Pushing the Algorith-mic Differentiation tool Tapenade towardsnew languages

Peter Stechlinski, Generalized SensitivityAnalysis of Nonlinear Programs

Kamil Khan, Evaluating generalizedderivatives efficiently for nonsmoothcomposite functions

Lisa Hegerhorst, Optimality Conditionsfor Nonsmooth Constrained OptimizationProblems

Salle 18 High-Performance Computing in Optimization I, Organizer: Kibaek Kim, session 271 AlgoBuild I, Z 71st floor3x30 min

Ted Ralphs, Performance Assessment forParallel MILP Solvers

Yuji Shinano, Ubiquity Generator Frame-work to parallelize state-of-the-art B and Bbased solvers

Kibaek Kim, Branching Strategies on De-composition Methods for Mixed-IntegerProgramming

42

Room Invited Talks - Thursday 8:30 AM – 10:30 AMSIGALAS Energy, Chair: Kazem Abbaszadeh, session 387 INTERFACEBuild C, Z 22nd floor4x30 min

Rishi Adiga, Optimization Models forGeothermal Energy

Rodolphe Griset, Static robustness forEDF nuclear long term production plan-ning

GabrielaMaschietto, Optimization of dis-trict heating production operations

Mahbubeh Habibian, Demand and reserveco-optimization for a price-making con-sumer of electricity

43

Room Invited Talks - Thursday 11:00 AM – 12:00 AMAuditorium The BARON software for MINLP, Organizer: Claudia D Ambrosio, session 547 SEMIBuild Symph H, Z 0Gambetta1x60 min

Nikolaos Sahinidis, The BARON softwarefor MINLP

BROCA Cutting Planes in the Extended Space, Organizer: Adam N Letchford, session 543 KEYNOTEBuild W, Z 03rd floor1x60 min

Oktay Gunluk, Cutting Planes in the Ex-tended Space

DENIGES Effective Scenarios and Scenario Reduction for Risk-Averse Stochastic Programs,Organizer: Jim Luedtke, session 544

KEYNOTE

Build C, Z 5Ground Floor1x60 min

Tito Homem-de-Mello, Effective Scenar-ios and Scenario Reduction for Risk-Averse Stochastic Programs

44

Room Invited Talks - Thursday 1:30 PM – 2:30 PMAuditorium Randomness, risk and electricity prices, Organizer: Michael C Ferris, session 554 PLENARYBuild Symph H, Z 0Gambetta1x60 min

Andy Philpott, Randomness, risk andelectricity prices

45

Room Discrete Optimization & Integer Programming - Thursday 3:15 PM – 4:45 PMSalle 42 Non-Standard IP Methods, Chair: Ulf Friedrich, session 513 IPtheoryBuild C, Z 13rd floor3x30 min

Tri-Dung Nguyen, Algebraic Geometryand Integer Programmings in CooperativeGame Theory

Wolfgang Keller, A hierarchy of cuttingplane operators based on lineality spaces

Ulf Friedrich, A power series algorithmfor non-negative IP

Salle 43 Polynomial Time Solvable Problems and Complete Descriptions, Chair: Andreas Bärmann, session 520 IPtheoryBuild C, Z 13rd floor3x30 min

A-E Falq, Extreme points for schedulingaround a common due date

Lars Rohwedder, On Integer Program-ming and Convolution

Andreas Barmann, The Clique Problemwith Multiple-Choice Constraints and TwoPolynomial Subcases

Salle 44 Computational Issues in Integer Programming, Organizer: Ricardo Fukasawa, session 289 IPpracticeBuild C, Z 13rd floor3x30 min

Laurent Poirrier, Implementation andperformance of the simplex method

Giulia Zarpellon, Learning MILP resolu-tion outcomes before reaching time-limit

Aleksandr Kazachkov, ComputationalResults with V-Polyhedral Cuts andStrengthening Approaches

Salle 39 Convexification and more (I), Organizer: Jon Lee, session 62 MINLPBuild E, Z 13rd floor3x30 min

Marcia Fampa, Treating indefinitequadratic and bilinear forms in MINLP

Amelie Lambert, Valid inequalities forQCQPs

Luze Xu, More Virtuous Smoothing

Salle 34 Heuristics in MINLP, Chair: Bertrand Travacca, session 276 MINLPBuild B, Z 31st floor3x30 min

Joao Lauro Faco’, MINLP solutions usinga Generalized-GRASP solver

Christoph Neumann, Feasible roundingideas for mixed-integer optimization prob-lems

Bertrand Travacca, Dual Hopfield Mod-els for Large Scale Mixed Integer Pro-gramming

Salle 35 MINLP with quadratic terms, Chair: Enrico Bettiol, session 282 MINLPBuild B, Z 4Intermediate3x30 min

Fabricio Oliveira, The p-Lagrangianmethod for MIQCQPs

Etienne Leclercq, A dedicated version ofBiqCrunch for solving the Max-Stable Setproblem exactly

Enrico Bettiol, Simplicial Decompositionfor quadratic convex 0-1 problems

LEYTEIRE Approximation Algorithms for Clustering., Organizer: Deeparnab Chakrabarty, session 32 APPROXBuild E, Z 13rd floor3x30 min

JaroslawByrka, Constant-Factor Approx-imation for Ordered k-Median

Amit Jayant Deshpande, Sampling-basedalgorithms and clustering with outliers

Deeparnab Chakrabarty, GeneralizedCenter Problems with Outliers

Salle 36 Routing and Inventory, Organizer: Dorit Hochbaum, session 343 APPROXBuild B, Z 4Intermediate3x30 min

Alexander Birx, Improved upper boundfor online Dial-a-Ride on the line

Jan Marcinkowski, A 4/5 - Approxima-tion Algorithm for the Maximum TravelingSalesman Problem

Dorit Hochbaum, The gap between thecontinuous and discrete ReplenishmentSchedule problem

SIGALAS Algorithms for TSP, Organizer: Ola Svensson, session 239 COMBBuild C, Z 22nd floor3x30 min

Vera Traub, Approaching 3/2 for the s-t-path TSP

Ramamoorthi Ravi, Cut-Covering Decom-positions for Connectivity Problems

Ola Svensson, A Constant-factor Approx-imation Algorithm for the AsymmetricTraveling Salesman

DURKHEIM Applications of CP, Organizer: Louis-Martin Rousseau, session 284 CPBuild A, Z 13rd floor3x30 min

Olivier Bachollet, A Constraint Program-ming approach to a meal delivery problem

Florian Grenouilleau, A DecompositionApproach for the Home Health Care Rout-ing and Scheduling Problem

Louis-Martin Rousseau, A CP Approachto the Traveling Salesman Problem in thePostal Services

46

Room Optimization under Uncertainty - Thursday 3:15 PM – 4:45 PMSalle 32 Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 1,

Organizer: Vincent Leclère, session 246Stoch

Build B, Z 5Ground Floor3x30 min

David Wozabal, Computing parametersensitivities for discrete time Markov de-cision processes

Nils Lohndorf, Modeling time-dependentrandomness in stochastic dual dynamicprogramming

Benoit Legat, Computing ellipsoidal con-trolled invariant sets for stochastic pro-gramming

DENIGES Distributionally Robust Optimization With Marginals and Cones,Organizer: Divya Padmanabhan, session 354

Robust

Build C, Z 5Ground Floor3x30 min

Louis Chen, Distributionally RobustLinear and Discrete Optimization withMarginals

Guanglin Xu, A Copositive Approach forDecision Rule Approximations of Multi-Stage RO

Divya Padmanabhan, Tractable Solutionsto Distributionally Robust Optimisation

Salle 37 Non-linear robust optimization, Chair: Laurent Alfandari, session 460 RobustBuild B, Z 4Intermediate3x30 min

Daniel de Roux, Graph learning with theWasserstein metric

Laurent Alfandari, Robust optimizationfor non-linear impact of data variation

Suh-Wen Chiou, A mathematical programfor signal control with equilibrium con-straints

Salle 30 Generation and Representation Algorithms in Multiobjective Optimization,Organizer: Michael Stiglmayr, session 267

Game

Build B, Z 5Ground Floor3x30 min

Britta Schulze, On a Polynomial Boundin Multiobjective Unconstrained Combina-torial Optimization

Kathrin Klamroth, Efficient Representa-tion of the Search Region and Generic Al-gorithms in MOCO

Michael Stiglmayr, Representation of thenon-dominated set of multiobjective opti-mization problems

47

Room Continuous Optimization - Thursday 3:15 PM – 4:45 PMSalle 05 Methods of Optimization in Riemannian Manifolds, Organizer: Orizon P Ferreira, session 21 NLPBuild Q, Z 111st floor3x30 min

Paulo Oliveira, A two-phase proximal-like algorithm in domains of positivity

Glaydston Bento, Proximal pointmethod in multiobjective optimizationon Hadamard manifolds

Orizon Ferreira, Newton’s Method forLocally Lipschitz vector Fields on Rie-mannian Manifolds

Salle 8 Extending the Reach of First-Order Methods, Part II, Organizer: Robert M. Freund, session 286 NonSmoothBuild N, Z 124th floor3x30 min

Matus Telgarsky, Risk and parameterconvergence of logistic regression

Alp Yurtsever, A conditional gradientframework for composite convex mini-mization

Robert Freund, Accelerating Greedy Co-ordinate Descent Methods

Salle LC5 Noncommutative polynomial optimization: semidefinite relaxations, free convexity and applications toquantum information II, Organizer: Monique Laurent, session 18

SDP

Build L, Z 10Intermediate 13x30 min

Sander Gribling, Quantifying entangle-ment of a quantum correlation using poly-nomial optimization

Antonios Varvitsiotis, Graph isomor-phism: conic relaxations and physical in-terpretation

Farid Alizadeh, Optimization over uni-variate polynomials: Algorithms and ap-plications

Salle 06 Nonlinear Optimization and Variational Inequalities II, Organizer: Cong Sun, session 141 VariatBuild Q, Z 111st floor3x30 min

Xin Liu, On the Lojasiewicz Exponent ofQuadratic Minimization with Sphere Con-straint

Bin Gao, A Parallelizable Algorithm forOrthogonally Constrained OptimizationProblems

YanfeiWang, A Joint Matrix MinimizationApproach for Seismic Wavefield Recovery

Salle KC6 Asynchronous Parallel and Distributed Optimization, Organizer: Wotao Yin, session 200 RandomMBuild K, Z 10Intermediate 13x30 min

Remi Leblond, Improved asynchronousparallel optimization analysis for incre-mental methods

Robert Hannah, Why Asynchronous Al-gorithms may Drastically Outperform Tra-ditional Ones

Renato Monteiro, Complexity of aquadratic penalty accelerated inexactproximal point method

Salle AURIAC Theory and Methods for ODE- and PDE-Constrained Optimization 2, Chair: Johann Schmitt, session 333 ControlBuild G, Z 61st floor2x30 min

Johann Schmitt, Optimal boundary controlof hyperbolic balance laws with state con-straints

Paloma Schafer Aguilar, Numerical ap-proximation of optimal control problemsfor conservation laws

48

Room Specific Models, Algorithms, and Software - Thursday 3:15 PM – 4:45 PMFABRE Accelerating Learning, Organizer: Martin Takac, session 322 LearningBuild J, Z 8Ground Floor3x30 min

Damien Scieur, Nonlinear Acceleration ofStochastic Algorithms

Sai Praneeth Karimireddy, AcceleratedFirst Order Methods with ApproximateSubproblems

Angelia Nedich, Optimal Algorithms forDistributed Optimization

Salle 16 Robust first order methods, Organizer: Fatma Kilinc-Karzan, session 332 LearningBuild I, Z 72nd floor3x30 min

Dimitris Papailiopoulos, Robust dis-tributed learning in the face of adversity

SuriyaGunasekar, Characterizing implicitbias of optimization and its role in general-ization

Nam Ho-Nguyen, First-order Frameworkfor Robust Convex Optimization

PITRES Path Problems, Chair: Yanchao Liu, session 453 LogisticsBuild O, Z 8Ground Floor2x30 min

Edward He, Dynamic Discretization Dis-covery Algorithms for Time-DependentPath Problems

Yanchao Liu, Drone Path Planning andAerial Traffic Flow

Salle 18 Production Planning, Chair: Michel Siemon, session 531 SchedulingBuild I, Z 71st floor3x30 min

Tobias Hofmann, ISO-PESP - A PESPVariant for Minimizing the Cycle Time ofProduction Lines

Julia Lange, A matheuristic for the block-ing job shop problem with a tardiness ob-jective

Michel Siemon, Value-based End-to-EndProduction Planning in Non-Ferrous MetalIndustry

Salle DENUCE Optimization Models for Renewable Energy Integration 1, Organizer: Luis F Zuluaga, session 120 EnergyBuild Q, Z 8Ground Floor3x30 min

Panagiotis Andrianesis, Optimal Grid Op-eration and DER Dispatch in Active Distri-bution Networks

Galina Orlinskaya, Bilevel Optimizationfor Flexible Electricity Supply Tariff De-sign

Luis Zuluaga, Competitive equilibriumand revenue adequate prices for robust en-ergy markets

Salle 23 Progress in Algorithms for Optimal Power Flow Problems II, Chair: Miguel F Anjos, session 509 EnergyBuild G, Z 63rd floor3x30 min

Alvaro Lorca, Robust Optimization forthe Alternating Current Optimal PowerFlow Problem

Ksenia Bestuzheva, Global Optimizationfor Alternating Current Optimal PowerFlow

Andreas Grothey, Optimal Power Flowsolver based on HELM

Salle 24 Electricity Generation Scheduling and Dispatch, Chair: Christophe Duhamel, session 511 EnergyBuild G, Z 63rd floor3x30 min

Beste Basciftci, Data-Driven GeneratorMaintenance and Operations Schedulingunder Uncertainty

Diego Jimenez, A Network Flow–BasedMILP Formulation for the Thermal UnitCommitment Problem

Christophe Duhamel, solving the Short-term Hydrothermal Scheduling problemwith linearizations

Salle LA4 Inverse Problems in Physics, Chair: Leo Liberti, session 391 SciencesBuild L, Z 8Basement3x30 min

Andreas Alpers, On the reconstruction oflattices from diffraction data

Fabian Klemm, Grain map reconstructionby means of generalized Voronoi Diagrams

Leo Liberti, Scientific applications of dis-tance geometry

Salle 22 High-Performance Computing in Optimization II, Chair: Joaquim Dias Garcia, session 466 AlgoBuild G, Z 62nd floor3x30 min

Timotej Hrga, High-Performance Solverfor Binary Quadratic Problems

Brian Dandurand, Bilevel optimizationapproaches for power system security

Joaquim Dias Garcia, Genesys: Simulat-ing Power Systems by Solving Millions ofMIPs

49

Room Discrete Optimization & Integer Programming - Thursday 5:00 PM – 6:30 PMSalle 43 Advances in Integer Programming, Organizer: Robert Hildebrand, session 227 IPtheoryBuild C, Z 13rd floor4x20 min

Laura Sanita, On the diameter of the frac-tional matching polytope

Gonzalo Munoz, Treewidth-based Exten-sion Complexity Lower Bounds

Igor Malinovic, On valid inequalities forknapsack polytopes

Robert Hildebrand, Polynomial IntegerProgramming in Fixed Dimension and Ap-plications in FPT

Salle 42 Cutting Planes for Special Problems, Chair: Eleazar Madriz, session 517 IPtheoryBuild C, Z 13rd floor3x30 min

Ruslan Simanchev, Separation problem for2-partition inequalities

Marko Horvath, Polyhedral results for po-sition based scheduling of chains on a sin-gle machine

EleazarMadriz, A Benders procedure forthe b-complementary multisemigroup dualprogram.

Salle 36 Matching Problems, Organizer: Sergio García Quiles, session 175 IPpracticeBuild B, Z 4Intermediate4x20 min

Thanh Nguyen, Stable Matching with Pro-portionality Constraints

Maxence Delorme, Mathematical modelsfor stable marriage problems with ties

William Pettersson, Improvements inKidney Exchange Programme Models forLarge-Scale Programmes

Peter Biro, Stable project allocation underdistributional constraints

Salle 44 Cutting Planes, Chair: Fabrizio Marinelli, session 485 IPpracticeBuild C, Z 13rd floor4x20 min

Edvin ABlad, A tighter ILP model and animproved branching for a load-balancingproblem

Savio Dias, A Branch-and-Cut Approachfor the Car Renter Salesman Problem

Georgia Souli, On Lifted Cover Inequal-ities: A New Lifting Procedure with Un-usual Properties

Fabrizio Marinelli, Exploiting star in-equalities for the maximum quasi-cliqueproblem

DURKHEIM Convexification and more (II), Organizer: Akshay Gupte, session 106 MINLPBuild A, Z 13rd floor3x30 min

Christoph Buchheim, Binary Program-ming with Semilinear Elliptic PDE-constraints

Christopher Coey, Using algebraic struc-ture to accelerate polyhedral approxima-tion

Andres Gomez, Quadratic optimizationwith M-matrices and semi-continuous vari-ables

Salle 34 Relaxations in MINLP, Chair: Jan Kronqvist, session 280 MINLPBuild B, Z 31st floor3x30 min

Ralf Lenz, Tight Convex Relaxations forExpansion Planning of Potential DrivenNetworks

Jan Kronqvist, Using Regularization andSecond Order Derivatives with Outer Ap-proximation

Andreas Lundell, The Supporting Hy-perplane Optimization Toolkit for ConvexMINLP

Salle 35 Applications in MINLP, Chair: Justo Puerto, session 283 MINLPBuild B, Z 4Intermediate3x30 min

Do Duc Le, Modeling and optimizationof traffic at traffic-light controlled intersec-tions

Maximilian Merkert, Flow-based ex-tended formulations for feasible trafficlight controls

Justo Puerto, MINLP for pricing transac-tion costs in different models of portfolioselection

LEYTEIRE Approximation Algorithms for Optimization under Uncertainty, Organizer: Marc Uetz, session 95 APPROXBuild E, Z 13rd floor3x30 min

Thomas Kesselheim, Prophet InequalitiesMade Easy: Stochastic Opt. by PricingNon-Stochastic Inputs

Max Klimm, Hiring Secretaries over Time:The Benefit of Concurrent Employment

Marc Uetz, Greed is Good - Online Al-gorithms for Stochastic Unrelated MachineScheduling

Salle 41 Approximation algorithms for combinatorial optimization problems,Organizer: Thomas Rothvoss, session 265

COMB

Build C, Z 13rd floor3x30 min

Mohit Singh, Approximation Algorithmsfor Diverse Subset Selection Problems

Roy Schwartz, Local Guarantees in GraphCuts and Clustering

AnupamGupta, Scheduling Stochastic Jobson Unrelated Machines

Salle 39 Heuristics for combinatorial optimization problems, Chair: Evren Guney, session 428 COMBBuild E, Z 13rd floor4x20 min

Cid de Souza, A Matheuristic to the Fire-fighter Problem on Graphs

Shinsaku Sakaue, Accelerated Best-firstSearch for Monotone Submodular Func-tion Maximization

Kazuya Fukuoka, A statistical stoppingcriterion for simulated annealing

Evren Guney, A Lagrangean RelaxationBased Heuristic For Efficient InfluenceMaximization

50

Room Optimization under Uncertainty - Thursday 5:00 PM – 6:30 PMSalle 32 Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 2,

Organizer: Vincent Leclère, session 247Stoch

Build B, Z 5Ground Floor4x20 min

Oscar Dowson, The practitioners guide toSDDP: lessons from SDDP.jl

Francois Pacaud, Decomposing DynamicProgramming equations: from global tonodal value functions

Vitor de Matos, Energy portfolio opti-mization for Brazilian distribution compa-nies: a multistage

Luiz Carlos da Costa Junior, Stochasticprogramming framework for risk aversionrepresentation with SDDP

Salle 30 Topics in multistage stochastic optimization, Chair: Felipe Beltrán, session 492 StochBuild B, Z 5Ground Floor3x20 min

Min Zhang, Risk Minimization, RegretMinimization and the Progressive HedgingAlgorithm

David Hemmi, Recursive Evaluate and Cutfor combinatorial Multistage Programs

Felipe Beltran, Stochastic dual dynamicprogramming with Chebyshev centers

DENIGES Robust Optimization under Data Uncertainty, Organizer: Omid Nohadani, session 98 RobustBuild C, Z 5Ground Floor3x30 min

Matthias Ehrgott, Uncertain Data Envel-opment Analysis

Soroosh Shafieezadeh, Wasserstein Distri-butionally Robust Kalman Filtering

Zhenzhen Yan, Appointment SchedulingUnder Time-Dependent Patient No-ShowBehavior

Salle 37 Combinatorial robust optimization I, Organizer: Marc Goerigk, session 167 RobustBuild B, Z 4Intermediate4x20 min

Artur Pessoa, Solving the Robust Capac-itated Vehicle Routing Problem Under De-mand Uncertainty

Marc Goerigk, Approximating combi-natorial optimization problems with theOWA criterion

Oyku Naz Attila, Reformulations for Ro-bust Lot-Sizing Problem with Remanufac-turing

Christoph Hansknecht, ast robust shortestpath computations

Salle 31 Approximation in dynamic programming, Chair: Philip C Placek, session 382 MarkovBuild B, Z 5Ground Floor3x30 min

Wolf Kohn, Dynamic Programming via aState Abstract Machine and Implementa-tion

Philip Placek, An Incremental ProbabilityModel for Dynamic Systems

Benoit Tran, A Stochastic Min-plus Algo-rithm for Deterministic Optimal Control

51

Room Continuous Optimization - Thursday 5:00 PM – 6:30 PMSalle 05 Polynomial and tensor optimization II, Organizer: Jiawang Nie, session 6 NLPBuild Q, Z 111st floor4x20 min

DidierHenrion, Computing invariant mea-sures with the Lasserre hierarchy

Anwa Zhou, Completely positive tensor re-covery with minimal nuclear value

Joao Gouveia, Phaseless rank of a matrix Xinzhen Zhang, A Complete SemidefiniteAlgorithm for Detecting Copositive Matri-ces and Tensors

Salle KC7 First Order Methods II, Chair: Guillaume Berger, session 437 NLPBuild K, Z 10Intermediate 23x20 min

Guillaume Berger, Hölder-continuousgradient and first-order approximationaccuracy

Andersen Ang, Accelerating NonnegativeMatrix Factorization Algorithms using Ex-trapolation

Lei Zhao, First-Order Primal-Dual Methodfor Nonlinear Convex Cone Programs

Salle 20 Global Optimization 3, Chair: Jean-Baptist Hiriart-Urruty, session 503 GlobalBuild G, Z 61st floor4x20 min

Jaromil Najman, Tighter McCormick re-laxations through subgradient propagationin a BaB framework

Simon Boulmier, Nonlinear branch-and-bound improvements for global optimiza-tion

Mester Abigel, JAVA implementation ofa modular, population based global opti-mizer package

Tiago Montanher, A rigorous MINLPsolver using interval unions

Salle LC4 Efficient Semismooth Newton Methods for Large Scale Statistical Optimization Problems,Organizer: Defeng Sun, session 123

NonSmooth

Build L, Z 9Intermediate 13x30 min

Meixia Lin, Efficient sparse Hessian basedalgorithms for the clustered lasso problem

Yangjing Zhang, An efficient algorithmfor solving large scale sparse group Lassoproblems

Defeng Sun, On the efficient computationof the projector over the Birkhoff polytope

Salle 8 Different faces of nonsmoothness in optimization, Organizer: Tim Hoheisel, session 212 NonSmoothBuild N, Z 124th floor3x30 min

Oliver Stein, Global optimization ofGSIPs using disjunctive programming

Abraham Engle, Superlinear Conver-gence of QN Methods for PLQ Convex-Composite Optimization

Tim Hoheisel, Applications of the general-ized matrix-fractional function

Salle AURIAC Recent Advances in Conic Programming III, Organizer: Masakazu Muramatsu, session 84 SDPBuild G, Z 61st floor4x20 min

Makoto Yamashita, A path-followingmethod for semidefinite programmingwithout Slater condition

Tang Peipei, A Majorized Newton-CGALM for Linearly Constrained ConvexProgramming

Yoshio Ebihara, Analysis of Positive Sys-tems by Semidefinite and Copositive Pro-gramming

Yuzhu Wang, Acceleration of theLagrangian-DNN method for a classof QOPs

Salle LC5 Using coning programming in problems solving, Chair: Kurt Majewski, session 497 SDPBuild L, Z 10Intermediate 14x20 min

Vilmar Jefte De Sousa, Linear Relaxationof Maximum k-Cut with Semidefinite-Based Constraints

Anja Kuttich, Feedback Controller andTopology Design for uncertain mechanicalsystems

Julie Sliwak, Stabilization of the moment-based approach to prove global optimalityfor ACOPF

Kurt Majewski, Maximum Volume In-scribed Ellipsoids for Specific AbsorptionRate Bounds in MRI

Salle 06 VU-decomposition techniques for nonsmooth optimization, Organizer: Claudia Sagastizabal, session 158 VariatBuild Q, Z 111st floor3x30 min

Shuai Liu, An epsilon-VU algorithm withsuperlinear convergence

Claudia Sagastizabal, A derivative-freeVU-algorithm for convex finite-maxproblems

Lucas Simoes, A Fast Gradient Sampling-like Method for Solving Nonsmooth Opti-mization Problems

Salle ARNOZAN Variational Analysis 5, Organizer: David Sossa, session 371 VariatBuild Q, Z 8Ground Floor4x20 min

Francisco Jara-Moroni, A global-local ap-proach for stochastic programs with com-plementarity constraints

Miguel Sama, Conical Regularization ofMultiobjective Optimization Problems

David Sossa, Complementarity problemswith respect to Loewnerian cones

Chee Khian Sim, Relaxed Peaceman-Rachford Splitting Method: ConvergenceStudy

Salle KC6 Recent Progress on Second-order Type Optimization Methods, Organizer: Andre Milzarek, session 302 RandomMBuild K, Z 10Intermediate 13x20 min

Ching-pei Lee, Inexact SuccessiveQuadratic Approximation for RegularizedOptimization

Jiang Hu, Structured Quasi-Newtonmethod For Optimization with Orthogo-nality Constraints

Andre Milzarek, A stochastic semis-mooth Newton method for nonsmoothnonconvex optimization

Salle 21 Advances in DFO III, Chair: Juan C Meza, session 496 DerFreeBuild G, Z 6Intermediate3x30 min

Jan Feiling, Utilizing Non-CommutativeMaps in Derivative-Free Optimization

Richard Carter, Generalization of DI-RECT algorithm supporting interactiveproblem redefinition

Juan Meza, Pattern Search Methods WithSurrogates for Surface Structure Determi-nation

52

Room Specific Models, Algorithms, and Software - Thursday 5:00 PM – 6:30 PMFABRE First-order methods for large-scale convex problems II, Organizer: Stephen A Vavasis, session 318 LearningBuild J, Z 8Ground Floor4x20 min

Madeleine Udell, Convex Low RankSemidefinite Optimization

Simon Lacoste-Julien, Frank-Wolfe Split-ting via Augmented Lagrangian Method

Francois Glineur, Extending performanceestimation beyond exact convex fixed-stepmethods

Xuan Vinh Doan, Low-Storage Condi-tional Gradient Method for Low-Rank andSparse Optimization

Salle 16 Advances in Reinforcement Learning Algorithms, Organizer: Lin Xiao, session 329 LearningBuild I, Z 72nd floor4x20 min

Mengdi Wang, Compressive Learning forSequential Decision Process

ShipraAgrawal, Posterior sampling for re-inforcement learning

Lihong Li, SBEED learning: Convergentcontrol with nonlinear function approxi-mation

Adithya M Devraj, Zap Q-Learning:Fastest Convergent Q-learning

Salle 22 Ranking and recommendation, Chair: Aleksandra Burashnikova, session 472 LearningBuild G, Z 62nd floor4x20 min

Aleksandra Burashnikova, Learning On-line Ranking Models with a Sequential Op-timization Algorithm

IbrahimMuter, Integrating Individual andAggregate Diversity in Top-N Recommen-dation

Engin Tas, A stochastic gradient descentalgorithm for learning to rank

Jose Dula, The Recommender Problemwith Convex Hulls

Salle 24 Vehicle Routing III, Chair: Raquel Bernardino, session 413 LogisticsBuild G, Z 63rd floor3x20 min

Raquel Bernardino, A hybrid algorithmfor the family traveling salesman problem

Roghayeh Hajizadeh, Snow removal:Modeling and bounds by relaxation,heuristic and branch-and-bound

Vitor Nesello, Column Generation BasedLocal Search for Pickup-and-Deliveryproblems

Salle 18 Supply Chain, Chair: Daniel Ramón-Lumbierres, session 533 SchedulingBuild I, Z 71st floor4x20 min

Wei Huang, Using SAP Integrated Busi-ness Planning to Optimize Supply Chain

Florian Fontan, Complexity ofprocessing-time dependent profit maxi-mization scheduling problems

Abdessamad Ouzidan, Modelization andoptimization of inventory management forpalletization

Daniel Ramon-Lumbierres, A multistagestochastic programming model for thestrategic supply chain design

Salle DENUCE Equilibrium and Optimization in Energy Markets, Organizer: Asgeir Tomasgard, session 151 EnergyBuild Q, Z 8Ground Floor3x30 min

Steven Gabriel, Bilevel Linear Program-ming Investment Problems Lower-LevelPrimal and Dual Variables

Endre Bjorndal, The Flow-Based Mar-ket Coupling Model and the Bidding ZoneConfiguration

Asgeir Tomasgard, A European powermarket model with short- and long-termuncertainty

Salle 23 Gas Network and Market Optimization, Organizer: Jonas Schweiger, session 293 EnergyBuild G, Z 63rd floor3x30 min

Jonas Schweiger, Foresighted decisionsupport for gas network operation

Felix Hennings, Controlling complex net-work elements by target values

Julia Grubel, Nonconvex EquilibriumModels for Gas Market Analysis

Salle LA4 Medicine and Metabolic engineering, Chair: Mahdi Doostmohammadi, session 396 SciencesBuild L, Z 8Basement4x20 min

Michelle Boeck, Model Predictive Controland Robust Optimization in Adaptive Ra-diation Therapy

Bjorn Moren, Improving a Dose-VolumeModel for HDR Brachytherapy to ReduceTumour Cold Spots

Amanda Smith, New bilevel formulationsfor optimizing flux bounds in metabolicengineering

Mahdi Doostmohammadi, MOMO - Multi-Objective Mixed integer Optimisation formetabolic engineering

Salle 9 Large-scale combinatorial optimization implementations, Organizer: Aaron Archer, session 96 AlgoBuild N, Z 124th floor4x20 min

Andrew Goldberg, Lost in Translation:Production Code Efficiency

Kevin Aydin, Distributed Balanced Parti-tioning via Linear Embedding

Christian Schulz, High Quality Graph andHypergraph Partitioning

Hossein Bateni, Solving Coverage Prob-lems on Massive Data

PITRES Computational OR in Julia/JuMP, Organizer: Miles Lubin, session 238 AlgoBuild O, Z 8Ground Floor3x30 min

Miles Lubin, JuMP 0.19 and MathOptIn-terface: new abstractions for mathematicaloptimization

Sebastien Martin, Optimizing Public Pol-icy: School Transportation and Start Timesin Boston.

Jarrett Revels, Capstan: Next-GenerationAutomatic Differentiation for Julia

53

Room Invited Talks - Thursday 5:00 PM – 6:30 PMSIGALAS Planning, Chair: Jeanjean Antoine, session 389 INTERFACEBuild C, Z 22nd floor4x20 min

Jeanjean Antoine, Planning model forrecommerce activities

Boris Grimm, A Propagation Approach forRailway Rolling Stock Optimization

Eric Bourreau, Real Size ExamTimetabling at Montpellier University(France)

Mohamed Benkirane, An HypergraphModel for the Rolling Stock Rotation Plan-ning and Train Selection

54

Room Discrete Optimization & Integer Programming - Friday 8:30 AM – 10:30 AMSalle 43 Recent advances in Integer Optimization, Organizer: Alberto Del Pia, session 218 IPtheoryBuild C, Z 13rd floor4x30 min

Jean-Philipp Richard, Computational eval-uation of new MIP models for tree ensem-bles optimization

Diego Moran, Strong duality for conicmixed-integer programs

Gustavo Angulo, An affine boundingmethod for two-stage stochastic integerprograms

Merve Bodur, Aggregation-based cutting-planes for packing and covering integerprograms

Salle 35 Mixed Integer Programming Representability, Organizer: Juan Pablo Vielma, session 275 IPtheoryBuild B, Z 4Intermediate4x30 min

Chris Ryan, Mixed-integer linear repre-sentability, disjunctions, and Chvátal func-tions

JoeyHuchette, A mixed-integer branchingapproach for very small formulations

Marc Pfetsch, On the Size of Integer Pro-grams with Sparse Constraints or BoundedCoefficients

Juan Pablo Vielma, Mixed-integer convexrepresentability

Salle 44 Integer Programming and Crew Scheduling, Organizer: Francois Soumis, session 292 IPpracticeBuild C, Z 13rd floor4x30 min

Francois Soumis, Dynamic ConstraintsAggregation for Crew Scheduling Problem

Vahid Zeighami, Integrated Crew Pairingand Personalized Crew Assignment Prob-lems

Frederic Quesnel, Considering prefer-ences and language skills in the airlinecrew pairings problem

Mohammed Saddoune, Alternate La-grangian Decomposition for IntegratedCrew Scheduling Problem

Salle 34 Optimal Control Problems with Discrete Switches, Organizer: Christian Kirches, session 102 MINLPBuild B, Z 31st floor3x30 min

Adrian Burger, An Algorithm for Model-Predictive Control of Switched NonlinearDynamic Systems

Felix Bestehorn, Approximation algo-rithms for MIOCPs with discontinuousswitch costs

Matthias Schloeder, Numerical Modelingof Switched Systems with Jumps in Opti-mal Control Problems

LEYTEIRE Data-Driven Revenue Management with Customer Choice, Organizer: Jacob Feldman, session 81 APPROXBuild E, Z 13rd floor4x30 min

Antoine Desir, Constrained AssortmentOptimization under the Markov Chainbased Choice Model

Danny Segev, Near-Optimal Approxima-tions for Dynamic Assortment Planningunder the MNL Model

Ali Aouad, Near-Optimal Approximationsfor Display Optimization Under MNLPreferences

Jacob Feldman, New Results for Assort-ment Optimization under the ExponomialChoice Model

Salle 36 Clustering., Organizer: Zac Friggstad, session 155 APPROXBuild B, Z 4Intermediate4x30 min

Arnaud de Mesmay, A Near-Linear Ap-proximation Scheme for Multicuts of Em-bedded Graphs

Vincent Cohen-Addad, On local search forclustering

Zac Friggstad, Approximation Schemesfor Clustering With Outliers

Ashkan Norouzi Fard, Dynamic FacilityLocation via Exponential Clocks

SIGALAS Matching and scheduling, Organizer: Seffi Naor, session 54 COMBBuild C, Z 22nd floor4x30 min

David Wajc, Online Matching in RegularGraphs (and Beyond)

Samir Khuller, Coflow Scheduling andbeyond

Guy Even, Best of Two Local Models:Centralized local and Distributed local Al-gorithms

Seffi Naor, Competitive Algorithms forOnline Multi-level Aggregation

Salle 41 Recent progress in graph cut problems, Organizer: Karthekeyan Chandrasekaran, session 244 COMBBuild C, Z 13rd floor4x30 min

Tamas Kiraly, Approximation of Linear 3-Cut and related problems

Euiwoong Lee, An FPT Algorithm Beat-ing 2-Approximation for k-Cut

YuryMakarychev, An Integrality Gap forthe Calinescu–Karloff–Rabani Relaxationfor Multiway Cut

Karthekeyan Chandrasekaran, Hyper-graph k-cut in randomized polynomialtime

Salle 39 Algorithmic aspects of connectivity in network design, Organizer: Neil Olver, session 264 COMBBuild E, Z 13rd floor4x30 min

Bundit Laekhanukit, Beyond Metric Em-bedding: Approximating Group Steiner onBounded Treewidth Graphs

Mateusz Lewandowski, ApproximatingNode-Weighted k-MST on Planar Graphs

Andre Linhares, Improved Algorithms forMST and Metric-TSP Interdiction

Kanstantsin Pashkovich, On the Integral-ity Gap of the Prize-Collecting Steiner For-est LP

DURKHEIM Graphical Optimization Model 2, Organizer: Maria I. Restrepo, session 297 CPBuild A, Z 13rd floor4x30 min

Simon de Givry, Recent algorithmic ad-vances for combinatorial optimization ingraphical models

Thomas Schiex, Learning and using Graph-ical models to design new molecules

Maria Restrepo, Integrated staffing andscheduling for home healthcare

Daniel Kowalczyk, Solving parallel ma-chine scheduling problems with B and Pand decision diagrams

55

Room Optimization under Uncertainty - Friday 8:30 AM – 10:30 AMDENIGES Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 3,

Organizer: Vincent Leclère, session 245Stoch

Build C, Z 5Ground Floor4x30 min

David Morton, Distributionally RobustDual Dynamic Programming

Andy Sun, Stochastic dual dynamic integerprogramming

Regan Baucke, A deterministic algorithmfor solving stochastic minimax dynamicprogrammes

Vincent Leclere, Exact convergingbounds for Stochastic Dual DynamicProgramming

Salle 32 New methods for stochastic optimization and variational inequalities, Chair: Yunxiao Deng, session 491 StochBuild B, Z 5Ground Floor4x30 min

Alfredo Iusem, Extragradient method forpseudomonotone stochastic variational in-equalities

Eduard Gorbunov, An Accelerated Ran-domized Method for Smooth StochasticConvex Optimization

Mihai Anitescu, Stochastic Analogues toDeterministic Optimization Methods

Yunxiao Deng, Convex Stochastic De-composition and Applications to MachineLearning

Salle 33 New Horizons in Robust Optimization, Organizer: Angelos Georghiou, session 447 RobustBuild B, Z 5Ground Floor3x30 min

ZhiChen, Data-driven Chance ConstrainedPrograms over Wasserstein Balls

Kilian Schindler, Cardinality-ConstrainedClustering and Outlier Detection via ConicOptimization

Angelos Georghiou, A robust optimiza-tion prospective to decentralized decisionmaking

Salle 31 Advances in theory of dynamic programming, Chair: Stephane L Gaubert, session 385 MarkovBuild B, Z 5Ground Floor4x30 min

Mauricio Junca, On controllability ofMarkov chains: A Markov Decision Pro-cesses approach

Angeliki Kamoutsi, Stochastic ConvexOptimization and Regret Bounds for Ap-prenticeship Learning

Nabil Kahale, Randomized DimensionReduction for Monte Carlo Simulations

Nikolas Stott, Dynamic programmingover noncommutative spaces applied toswitched systems

Salle 30 Algorithmic Game Theory II, Chair: Margarida Carvalho, session 372 GameBuild B, Z 5Ground Floor4x30 min

Anja Huber, Efficient Black-Box Reduc-tions for Separable Cost Sharing

Marton Benedek, Finding and verifyingthe nucleolus of cooperative games

Chuangyin Dang, Perfect d-Proper Equi-librium and Its Determination

Margarida Carvalho, Kidney ExchangeGame

56

Room Continuous Optimization - Friday 8:30 AM – 10:30 AMSalle 05 First order methods, Organizer: Gerardo Toraldo, session 27 NLPBuild Q, Z 111st floor4x30 min

Simone Rebegoldi, Variable metric tech-niques for the inexact inertial forward-backward algorithm

Daniela di Serafino, Combining IRN andgradient methods for TV-based Poissonimage restoration

William Hager, An Active Set Algorithmfor Polyhedral Constrained Optimization

Ignace Loris, A line-search based proxi-mal gradient method for (non-)convex op-timization

GINTRAC Stochastic and Nonlinear Optimization II, Organizer: Jorge Nocedal, session 48 NLPBuild Q, Z 8Ground Floor4x30 min

Mark Schmidt, "Active-set complexity" ofproximal-gradient: How long does it taketo find the

Daniel Robinson, A Positive Outlook onNegative Curvature

Albert Berahas, Derivative-Free Opti-mization of Noisy Functions via Quasi-Newton Methods

Lin Xiao, Randomized Primal-Dual Algo-rithms for Asynchronous Distributed Opti-mization

Salle KC7 Regularization and Iterative Methods in Large-Scale Optimization, Organizer: Jacek Gondzio, session 59 NLPBuild K, Z 10Intermediate 24x30 min

Paul Armand, Local analysis of a regular-ized primal-dual algorithm for NLP with-out SOSC

Dominique Orban, Implementing a smoothexact penalty function for nonlinear opti-mization

Spyridon Pougkakiotis, Dynamic primal-dual regularization in interior point meth-ods

Michael Saunders, Stabilized Optimiza-tion via an NCL Algorithm

Salle 9 Decomposition Methods, Chair: Roger Behling, session 431 NLPBuild N, Z 124th floor4x30 min

Roger Behling, Circumcentering the Dou-glas–Rachford method

Luiz-Rafael Santos, On the linear con-vergence of the circumcentered–reflectionmethod

Yuan Shen, Alternating Direction Methodof Multipliers for k-means Clustering

Leonardo Galli, A Nonomonotone De-composition Framework: convergenceanalysis and applications

Salle LC4 Geometry in complexity analysis of non-smooth optimization methods, Organizer: Jalal Fadili, session 199 NonSmoothBuild L, Z 9Intermediate 14x30 min

CharlesDossal, An ODE associated to theNesterov acceleration scheme

Guillaume Garrigos, Structured sparsityin inverse problems and support recovery

Anthony So, Error Bound-Based Con-vergence Rate Analysis of Newton-TypeMethods

Jalal Fadili, Finite Activity Identification:Geometry and Algorithms

Salle 8 Convergence analysis for non smooth optimization, Organizer: Robert Csetnek, session 557 NonSmoothBuild N, Z 124th floor4x30 min

Robert Csetnek, ADMM for monotoneoperators: convergence analysis and rates

Mattias Falt, Optimal Convergence Ratesfor Generalized Alternating Projections

Alain Zemkoho, Newton method forbilevel optimization: Theory+extensivenumerical experiments

Dennis Meier, Inducing strong conver-gence into the asymptotic behaviour ofproximal splitting

Salle 20 Copositive and completely positive optimization, Organizer: Olga Kuryatnikova, session 24 SDPBuild G, Z 61st floor4x30 min

Peter Dickinson, A New Certificate ForCopositivity

Markus Gabl, Copositive Approach to ad-justable robust optimization

Juan Vera, Using Binary Programming tosolve Copositive Optimization Problems

OlgaKuryatnikova, Copositive certificatesof non-negativity for polynomials on un-bounded sets

Salle LC5 Stability and scaling in conic programming, Chair: Diego Cifuentes, session 498 SDPBuild L, Z 10Intermediate 14x30 min

Roland Hildebrand, Scaling points andreach for non-self-scaled barriers

Hector Ramirez, Stability Analysis for Pa-rameterized Conic Programs

Wei Zhang, An improved projection andrescaling algorithm for conic feasible prob-lems

Diego Cifuentes, On the local stability ofsemidefinite relaxations

Salle 06 Stochastic Optimization and Variational Inequalites, Organizer: Hailin Sun, session 149 VariatBuild Q, Z 111st floor4x30 min

HuifuXu, Behavioural Function Equilibriaand Approximation Schemes in BayesianGames

Shu Lu, Inference of two stage stochasticprograms using SVI techniques

Xiaojun Chen, Theory and algorithms fortwo-stage stochastic variational inequali-ties

Hailin Sun, Sample average approxima-tion of two-stage stochastic generalizedequation

Salle ARNOZAN Variational Analysis 3, Organizer: Johanna Burtscheidt, session 369 VariatBuild Q, Z 8Ground Floor4x30 min

Johanna Burtscheidt, Stability and SmallApplication of a Risk Averse CP under Un-certainty

Hongbo Dong, Variable selection withheredity principles by nonconvex opti-mization

Goran Lesaja, Adaptive Full Newton-stepInfeasible Interior-Point Method for Suffi-cient HLCP

Henri Bonnel, Application of Optimiza-tion over the Pareto set in Machine Learn-ing

Salle KC6 Recent Advances in Coordinate Descent and Constrained Problems, Organizer: Ion Necoara, session 208 RandomMBuild K, Z 10Intermediate 13x30 min

Nicolas Loizou, Convergence Analysis ofInexact Randomized Iterative Methods

Konstantin Mishchenko, A StochasticPenalty Model for Optimization withMany Convex Constraints

Ion Necoara, Random coordinate descentmethods for linearly constrained convexoptimization

Salle 21 Challenging applications in DFO, Chair: Francesco Rinaldi, session 38 DerFreeBuild G, Z 6Intermediate4x30 min

A Ismael Vaz, Global Direct Search and anapplication to Additive Manufacturing (3DPrinting)

Stefano Lucidi, Derivative-free methodsfor complex black-box problems

Steven Gardner, Parallel Hybrid Multi-objective Derivative-Free Optimization forMachine Learning

Lukas Adam, Robust multi-objective opti-mization: Application to the recycling ofplastics

Salle AURIAC Optimal Control in Engineering Applications, Chair: Maxime Grangereau, session 310 ControlBuild G, Z 61st floor3x30 min

MasoumehMohammadi, A Priori Error Es-timates for a Linearized Fracture ControlProblem

Maxime Grangereau, Stochastic optimalcontrol of a battery : resolution withMcKean-FBSDE

Johanna Biehl, Adaptive Multilevel Opti-mization of Fluid-Structure Interaction

57

Room Specific Models, Algorithms, and Software - Friday 8:30 AM – 10:30 AMFABRE Dimensionality reduction tools for learning: A sketchy session, Organizer: Robert M Gower, session 313 LearningBuild J, Z 8Ground Floor3x30 min

Nicolas Keriven, Sketched Learning withRandom Feature Moments

Arthur Mensch, Stochastic Subsamplingfor Factorizing Huge Matrices

Alessandro Rudi, Optimal kernel methodsfor large scale machine learning

Salle 16 Dealing with non-convexity, Chair: Damek Davis, session 473 LearningBuild I, Z 72nd floor4x30 min

Leonard Berrada, Smoothing PiecewiseLinear Loss Functions for Deep Learning

Damek Davis, Convergence rates ofstochastic methods for nonsmooth non-convex problems

Cong Ma, Implicit Regularization in Non-convex Statistical Estimation

Naoki Marumo, Provable Convex Mini-mization under Non-convex Submodular-structured Sparsity

Salle 18 Telecommunications, Organizer: Edoardo Amaldi, session 361 NetworkBuild I, Z 71st floor4x30 min

Michal Pioro, An Optimization Model forQuadratic Flow Thinning

Matthias Rost, Approximating the VirtualNetwork Embedding Problem: Theory andPractice

Chafiq Titouna, DDRA: Distributed De-tection and Recovery Algorithm for Wire-less Sensor Networks

Edoardo Amaldi, On the Virtual NetworkEmbedding problem with substrate net-work expansion

PITRES Hybrid Algorithms and Matheuristics for VRP, Organizer: Thibaut Vidal, session 181 LogisticsBuild O, Z 8Ground Floor4x30 min

Thibaut Vidal, Heuristics for vehicle rout-ing problems: Sequence or set optimiza-tion?

Dominique Feillet, Single Liner ServiceDesign with Speed Optimization

Jean Bertran Gauthier, Heuristic pricingfor the shortest path problem with resourceconstraints

Pedro Diniz, Garbage Collection RoutingWith Heterogeneous Fleet

Salle 23 Scheduling Applications, Chair: Mauricio C. de Souza, session 526 SchedulingBuild G, Z 63rd floor3x30 min

Atsuko Ikegami, Generating many optimalsolutions in nurse scheduling

Davaatseren Baatar, Mixed Integer Pro-gramming Based Merge Search for OpenPit Block Scheduling

Mauricio de Souza, Surgical schedulingunder uncertainty by approximate dynamicprogramming

Salle 24 Power Systems Models with Discrete Decision Variables, Organizer: Adolfo R Escobedo, session 26 EnergyBuild G, Z 63rd floor3x30 min

Kai Pan, Co-optimizing Energy and Ancil-lary Services

Harsha Gangammanavar, StochasticFramework for Coordinated Operation ofMultiple Microgrids

Adolfo Escobedo, Generation of AngularValid Inequalities for Transmission Expan-sion Planning

Salle DENUCE Machine Learning in State Estimation and Situational Awareness in Power Grids,Organizer: Deepjyoti Deka, session 134

Energy

Build Q, Z 8Ground Floor4x30 min

Deepjyoti Deka, Learning with end-usersin distribution grids:Topology and parame-ter estimation

Marc Vuffray, Online Learning of PowerTransmission Dynamics

Mauro Escobar, Machine learning withPMU signals

Dongchan Lee, Convex polytope machineapproach for transient stability assessment

Salle LA4 Finance and Portfolio Optimization, Organizer: Asaf Shupo, session 395 SciencesBuild L, Z 8Basement3x30 min

Benjamin Heymann, Auction under ROIconstraints

Gabriela Kovacova, Time Consistency ofthe Mean-Risk Problem

Asaf Shupo, Building Optimal StrategiesUsing Multi-Objective Optimization

Salle 22 New Developments in Optimization Modeling Software, Organizer: Robert Fourer, session 101 AlgoBuild G, Z 62nd floor4x30 min

Steven Dirkse, Enhanced Model Deploy-ment and Solution in GAMS

David Gay, Adding Functions to AMPL Paul Kerr-Delworth, Optimization Mod-eling in MATLAB

Youngdae Kim, Efficient model generationfor decomposition methods in modelinglanguages

58

Room Invited Talks - Friday 11:00 AM – 12:00 AMAuditorium Tseng Memorial Lectureship in Continuous Optimization, Organizer: Yaxiang Yuan, session 549 SEMIBuild Symph H, Z 0Gambetta1x60 minLEYTEIRE Majority judgment , Organizer: Martine Labbé, session 535 KEYNOTEBuild E, Z 13rd floor1x60 min

Michel Balinski, Majority judgment

DENIGES Submodularity in mixed-integer quadratic and conic quadratic optimization,Organizer: Daniel Bienstock, session 540

KEYNOTE

Build C, Z 5Ground Floor1x60 min

Alper Atamturk, Submodularity inmixed-integer quadratic and conicquadratic optimization

BROCA Modern Branch-and-Cut Implementation, Organizer: Marc E Pfetsch, session 542 KEYNOTEBuild W, Z 03rd floor1x60 min

Matteo Fischetti, Modern Branch-and-Cut Implementation

59

Room Invited Talks - Friday 1:30 PM – 2:30 PMAuditorium Bounds for quantum graph parameters by conic and polynomial optimization,

Organizer: Frank Vallentin, session 553PLENARY

Build Symph H, Z 0Gambetta1x60 min

Monique Laurent, Bounds for quantumgraph parameters by conic and polynomialoptimization

60

Room Discrete Optimization & Integer Programming - Friday 3:15 PM – 4:45 PMSalle 34 Polyhedral theory in practice, Organizer: Mourad Baiou, session 309 IPtheoryBuild B, Z 31st floor3x30 min

Rafael Colares, The Stop Number Mini-mization Problem: polyhedral analysis

Francisco Barahona, On the nucleolus ofshortest path and network disconnectiongames

Mourad Baiou, On some network securitygames

Salle 42 Extended Formulations, Chair: Bartosz Filipecki, session 514 IPtheoryBuild C, Z 13rd floor3x30 min

Bernd Perscheid, An Extended Formula-tion for the 1-Wheels of the Stable SetPolytope

Mirjam Friesen, Extended formulationsfor higher-order spanning tree polytopes

Bartosz Filipecki, Stronger Path-basedExtended Formulation for the Steiner TreeProblem

Salle 44 Routing, Chair: Cole Smith, session 484 IPpracticeBuild C, Z 13rd floor3x30 min

Imke Joormann, Solving the Time-Dependent TSP using Machine LearningGuidance

Ann-Brith Stromberg, Column genera-tion for routing a fleet of plug-in hybrid ve-hicles

Cole Smith, The consistent path problemand binary decision diagrams

Salle 36 IP Practice III, Chair: Samuel S Brito, session 507 IPpracticeBuild B, Z 4Intermediate3x30 min

Franco Quezada, Valid inequalities forsolving a stochastic lot-sizing problemwith returns

Samuel Brito, Improving COIN-OR CBCMIP Solver Using Conflict Graphs

Maximilian John, Two Lower Bound Ap-proaches for the Keyboard Layout Problem

Salle 39 Outer Convexification and Mixed-Integer Optimal Control , Organizer: Sebastian Sager, session 103 MINLPBuild E, Z 13rd floor3x30 min

Paul Manns, Improved Regularity As-sumptions for Partial Outer Convexifica-tion of MIPDECOs

Clemens Zeile, Combinatorial Integral Ap-proximation Decompositions for Mixed-Integer Control

Oliver Habeck, Global optimization ofODE constrained network problems

DURKHEIM Intersection cuts, disjunctions, and valid inequalities, Organizer: Eli Towle, session 180 MINLPBuild A, Z 13rd floor3x30 min

Daniel Bienstock, Outer-product-freeSets for Polynomial Optimization

Egon Balas, Synthetizing branch-and-bound information into cutting planes

Eli Towle, Intersection disjunctions for re-verse convex sets

Salle 35 Branch-and-cut techniques, Organizer: Teodora Dan, session 277 MINLPBuild B, Z 4Intermediate3x30 min

Teodora Dan, A branch-and-bound al-gorithm for a bilevel location-allocationmodel

Lovis Anderson, Improving branching fordisjunctive models via approximate convexdecompositions

Tu Nguyen, Learning with Cutting Planes

LEYTEIRE Submodular Maximization., Organizer: Justin Ward, session 179 APPROXBuild E, Z 13rd floor3x30 min

Ilija Bogunovic, Robust Maximization ofSubmodular Objs. in the Presence of Ad-versarial Removals

Alfredo Torrico, Robust submodularmaximization under matroid constraints

Amin Karbasi, Submodular Optimization:From Discrete to Continuous and Back

Salle 43 Submodular and Incremental Maximization, Organizer: Martin Gross, session 340 APPROXBuild C, Z 13rd floor3x30 min

Rajan Udwani, Multi-objective Maximiza-tion of Monotone Submodular Functions

Tasuku Soma, A New ApproximationGuarantee for Submodular Maximizationvia Discrete Convexity

Martin Gross, General Bounds for Incre-mental Maximization

SIGALAS Combinatorial aspects of Linear Programming, Organizer: Daniel Dadush, session 259 COMBBuild C, Z 22nd floor3x30 min

Sophie Huiberts, A Friendly SmoothedAnalysis of the Simplex Method

Giacomo Zambelli, Geometric RescalingAlgorithms for Submodular Function Min-imization

Neil Olver, A Simpler and Faster StronglyPolynomial Algorithm for GeneralizedMax-Flow

61

Room Optimization under Uncertainty - Friday 3:15 PM – 4:45 PMSalle 32 Risk-aware decision making, Organizer: Minseok Ryu, session 251 StochBuild B, Z 5Ground Floor3x30 min

Hideaki Nakao, Medical Homecare Deliv-ery with Time-dependent Stochastic TravelTime

Zheng Zhang, A stochastic programmingapproach for optimization of latent diseasedetection

Minseok Ryu, Nurse staffing under uncer-tain demand and absenteeism

Salle 33 Distributionally Robust Optimization: Models and Applications,Organizer: Selin D Ahipasaoglu, session 355

Robust

Build B, Z 5Ground Floor3x30 min

Bikramjit Das, Heavy tails in a moment-constrained robust newsvendor model

Henry Lam, Robust Extreme Event Analy-sis

Selin Ahipasaoglu, Concentration versusDiversification in Portfolio Selection

DENIGES Distributionally Robust Optimization, Organizer: Daniel Kuhn, session 446 RobustBuild C, Z 5Ground Floor3x30 min

Napat Rujeerapaiboon, Chebyshev In-equalities for Products of Random Vari-ables

Johannes Royset, Variational Theory forOptimization under Stochastic Ambiguity

Daniel Kuhn, Distributionally Robust In-verse Covariance Estimation

Salle 31 Discrete stochastic dynamic programming, Chair: Adam Narkiewicz, session 384 MarkovBuild B, Z 5Ground Floor3x30 min

Victor Cohen, MILP formulations for dis-crete stochastic optimization (LIMIDs)

Axel Parmentier, LP relaxations for dis-crete stochastic optimization with varia-tional inference

Adam Narkiewicz, A sequential decisionprocess with stochastic action sets

Salle 30 Scalarization, representation and the comparison of methods in Multiobjective Optimization,Chair: Tyler Perini, session 378

Game

Build B, Z 5Ground Floor3x30 min

Kenza Oufaska, New scalarization tech-nique for solving multi-objective problems

Tyler Perini, Approximation of the fron-tier for a biobjective MIP: comparison be-tween methods

Kateryna Muts, Multi-Objective Opti-mization for the Compiler of Hard Real-Time Systems

62

Room Continuous Optimization - Friday 3:15 PM – 4:45 PMGINTRAC Interior Point Methods in Engineering Applications I, Organizer: Jacek Gondzio, session 60 NLPBuild Q, Z 8Ground Floor3x30 min

Sebastiaan Breedveld, A (non)convexinterior-point implementation tuned for ra-diotherapy optimisation

Lovisa Engberg, Refined planning tools forexternal radiotherapy using interior pointmethods

Renke Kuhlmann, Computational Study ofa Primal-Dual Penalty-Interior-Point Algo-rithm

Salle 05 Nonlinear Optimization, Chair: Marc C Steinbach, session 429 NLPBuild Q, Z 111st floor3x30 min

Ademir Ribeiro, On the Approximate So-lutions of Augmented Subproblems withinSequential Methods

Marc Steinbach, An Elastic Primal ActiveSet Method for Structured SQP

Hao Wang, A Dynamic Penalty ParameterUpdating Strategy for SQP Methods

Salle 20 Global Optimization 2, Chair: Mirjam Duer, session 502 GlobalBuild G, Z 61st floor3x30 min

Christian Fullner, Deterministic upperbounds in global minimization with equal-ity constraints

Andrei Orlov, Nonconvex OptimizationApproach to Equilibrium and Bilevel Prob-lems

Tatiana Gruzdeva, On Solving the GeneralFractional Problem via D.C. Optimization

Salle 8 Advances in the first-order methods for convex optimization, Organizer: Angelia Nedich, session 73 NonSmoothBuild N, Z 124th floor3x30 min

Hoi To Wai, Accelerated curvature-aidedincremental aggregated gradient method

Tatiana Tatarenko, Fast Incremental Gra-dient Method for Optimization with LinearConstraints

Maryam Yashtini, Efficient Methods ForEdge-weighted TV Models with SphereConstraints

Salle LC5 Relative Entropy Optimization I, Organizer: Venkat Chandrasekaran, session 111 SDPBuild L, Z 10Intermediate 13x30 min

Riley Murray, Exactness of Relative En-tropy Relaxations for Signomial Programs

Hamza Fawzi, Certificates of nonnegativityvia conic lifts

Michal Adamaszek, Exponential cone inMOSEK: overview and applications

Salle 06 Algorithms for optimization and variational problems with possibly nonisolated solutions II,Organizer: Alexey F. Izmailov, session 153

Variat

Build Q, Z 111st floor3x30 min

Mikhail Solodov, A globally convergentLP-Newton method for piecewise smoothconstrained equation

Daniel Steck, Some Developments onMultiplier Methods in Cone-ConstrainedOptimization

Paulo Silva, On the second order aug-mented Lagrangian method for MPCC

Salle ARNOZAN Nash equilibrium and Games 2, Organizer: Giancarlo Bigi, session 366 VariatBuild Q, Z 8Ground Floor3x30 min

Lorenzo Lampariello, Numericallytractable optimistic bilevel problems

Vadim Shmyrev, Polyhedral complemen-tarity algorithms for equilibrium problems

Giancarlo Bigi, Semi-infinite program-ming via two player generalized Nashgames and saddlepoints

Salle 21 Advances in DFO IV, Chair: Katya Scheinberg, session 125 DerFreeBuild G, Z 6Intermediate3x30 min

Krzysztof Choromanski, New methodsfor blackbox optimization via structuredgradient estimation

Katya Scheinberg, Scaling up and Ran-domizing Derivative Free Optimization forMachine Learning

Prashant Palkar, Globally ConvergentSimulation-Based Optimization with Inte-ger Variables

63

Room Specific Models, Algorithms, and Software - Friday 3:15 PM – 4:45 PMSalle 16 Discrete methods for data centers and graphs, Organizer: Aaron Archer, session 477 LearningBuild I, Z 72nd floor3x30 min

Philipp Keller, Overcommitment in CloudServices - Bin Packing with Chance Con-straints

Aaron Archer, Cache-aware load balanc-ing of data center applications via balancedpartitioning

Sergey Pupyrev, Compressing Graphs andIndexes with Recursive Graph Bisection

FABRE Classification, regression and clustering, Chair: Dimitris Bertsimas, session 480 LearningBuild J, Z 8Ground Floor3x30 min

Dimitris Bertsimas, Interpretable MachineLearning

InacioGuimaraes, Logistic Regression andPrincipal Curves Applied to DiscriminantAnalysis

James Brooks, Sufficient Conditions forL1-Norm Best-Fit Lines

Salle 24 Vehicle Routing II, Chair: Chris N Potts, session 412 LogisticsBuild G, Z 63rd floor3x30 min

Eduardo Uchoa, A Branch-Cut-and-PriceAlgorithm for the TSP with Hotel Selec-tion

Chris Potts, Models and Algorithms forDynamic Workforce Scheduling and Rout-ing

Stefan Schaudt, Delivery robots, a trans-port innovation for the last mile

Salle 18 Machine Scheduling 1, Chair: Renan S. Trindade, session 527 SchedulingBuild I, Z 71st floor3x30 min

Noam Goldberg, Maximum ProbabilisticAll-or-Nothing Paths and Critical Chains

Vitaly Strusevich, Max-Cost Schedulingwith Controllable Processing Times and aCommon Deadline

Renan Trindade, An arc-flow formulationfor minimizing makespan on a batch pro-cessing machine

Salle DENUCE Estimation and Learning for Power Systems, Organizer: Javad Lavaei, session 25 EnergyBuild Q, Z 8Ground Floor3x30 min

Yu Zhang, Performance Bound for PowerSystem State Estimation via Conic Relax-ations

Richard Zhang, Spurious Critical Points inPower System State Estimation

Ming Jin, Vulnerability analysis and robus-tification of power grid state estimation

Salle 22 Optimization in Energy, Chair: Andrea Simonetto, session 515 EnergyBuild G, Z 62nd floor3x30 min

Christiano Lyra, Upstream-downstreamdynamic programming for optimization oftree-shaped flows

Milena Petkovic, Mathematical Program-ming for Forecasting Supplies and De-mands in Gas Networks

Andrea Simonetto, Time-varying opti-mization: algorithms and engineering ap-plications

Salle 23 Optimization for Energy System Planning, Chair: Andrew Lu Liu, session 524 EnergyBuild G, Z 63rd floor3x30 min

Luigi Boffino, Expansion Planning of aSmall Size Electric Energy System

Marion Lemery, Regaining tractability inSDDP algorithms for large energy plan-ning problems

Andrew Liu, Capacity Expansion throughDecentralized Optimization

Salle LA4 Industrial dynamics and Environmental policy, Organizer: Inmaculada Garcia Fernandez, session 392 SciencesBuild L, Z 8Basement3x30 min

Adriana Piazza, Dynamics of Environ-mental Policy

Nils-Hassan Quttineh, Challenges in Nu-trient Recycling and Biogas Plant Local-ization

Inmaculada Garcia Fernandez, Use of dy-namic programming in inventory controlfor perishable products

PITRES Computational Integer Programming I, Organizer: Domenico Salvagnin, session 273 AlgoBuild O, Z 8Ground Floor3x30 min

Tobias Achterberg, Exploiting Degener-acy in MIP

Pierre Le Bodic, Online Estimation of theSize of the Branch and Bound Tree in MIPSolvers

Alinson Xavier, Multi-Row IntersectionCuts based on the Infinity Norm

64

Room Discrete Optimization & Integer Programming - Friday 5:00 PM – 6:30 PMSalle 34 Machine Learning and Discrete Optimization, Organizer: Sebastian Pokutta, session 308 IPtheoryBuild B, Z 31st floor4x20 min

Matteo Fischetti, Building adversarial ex-amples in Neural Networks by Mixed Inte-ger Optimization

Anirbit Mukherjee, Mathematics of Neu-ral Networks

Paul Grigas, Smart “Predict, then Opti-mize”

Sebastian Pokutta, Lazy Conditional Gra-dients through Simpler Oracles

Salle 44 Decomposition II, Chair: Natashia Boland, session 487 IPpracticeBuild C, Z 13rd floor4x20 min

Andre Cire, Discrete Nonlinear Optimiza-tion by State-Space Decompositions

Jens Clausen, Strengthening of mixed in-teger linear program bounds using variablesplitting

Cristiam Gil, A column generation basedmodel to pickup and delivery problemswith trans

Natashia Boland, Decomposition Branch-ing for Mixed Integer Programming

Salle 36 Dual Ascent, Chair: Sara Maqrot, session 505 IPpracticeBuild B, Z 4Intermediate2x20 min

Stefania Pan, A dual ascent procedurefor solving the generalized set partitioningmodel

Sara Maqrot, Improving Wedelin’sHeuristic with Sensitivity Analysis for SetPartitioning

DURKHEIM Mixed-Integer PDE-Constrained Optimization , Organizer: Sven Leyffer, session 63 MINLPBuild A, Z 13rd floor3x30 min

Meenarli Sharma, Inversion ofConvection-Diffusion PDE with Dis-crete Source

Martin Siebenborn, Shape optimizationtowards binary variables with PDE con-straints

Mirko Hahn, Set-valued steepest descentfor binary topology and control optimiza-tion

Salle 39 Global Optimization for nonconvex MINLPs, Organizer: Hassan Hijazi, session 92 MINLPBuild E, Z 13rd floor3x30 min

Anya Castillo, Global Optimization forAC Optimal Power Flow Applications

Harsha Nagarajan, Tight Piecewise For-mulations and Algorithms for Global Op-timization of MINLPs

Hassan Hijazi, Semidefinite ProgrammingCuts in Gravity

Salle 35 Recent Advances and Applications of MINLP, Organizer: Jose M Ucha, session 139 MINLPBuild B, Z 4Intermediate3x30 min

Victor Blanco, Duality and multidimen-sional kernels in `p-Support Vector Ma-chines

Jose Ucha, An algebraic exact method formulti-objective RAP in series-parallel sys-tems.

Jeffrey Zhang, On Testing Attainment ofthe Optimal Value in Nonlinear Optimiza-tion

LEYTEIRE Algorithmic Fairness and Optimization, Organizer: Nisheeth K Vishnoi, session 161 APPROXBuild E, Z 13rd floor4x20 min

Krishna Gummadi, Measuring Algorithmic(Un)Fairness via Inequality Indices

Elisa Celis, Controlling Bias in Bandit-based Personalization

Omer Reingold, Calibration for the(Computationally-Identifiable) Masses

Nisheeth Vishnoi, Fair and Diverse DPP-based Data Summarization

Salle 43 Algorithmic Discrepancy, Organizer: Nikhil Bansal, session 164 APPROXBuild C, Z 13rd floor3x30 min

Aleksandar Nikolov, Balancing Vectorsin Any Norm

Daniel Dadush, The Gram-Schmidt Walk:A cure to the Banaszczyk Blues

Rebecca Hoberg, A Fourier-Analytic Ap-proach For Random Set systems

SIGALAS Packing Steiner Trees, Organizer: Stephan Held, session 260 COMBBuild C, Z 22nd floor3x30 min

DirkMuller, Global Routing with TimingConstraints

Pietro Saccardi, Steiner Tree Packing inRhomboidal Tiles

Tilmann Bihler, Reach- and Direction-Restricted Rectilinear Steiner Trees

Salle 41 Optimization problems in graphs and related, Chair: Claudio Arbib, session 423 COMBBuild C, Z 13rd floor4x20 min

Xiucui Guan, Critical node problem basedon connectivity index and properties ofcomponents

Binwu Zhang, Inverse Obnoxious Span-ning Tree Problems under Hamming Dis-tance

Ping Zhan, The random assignment prob-lem on a full preference domain with sub-modular

Matteo Tonelli, On uncapacitated metriclocation and pricing

65

Room Optimization under Uncertainty - Friday 5:00 PM – 6:30 PMSalle 30 Topics in stochastic optimization, Chair: Quentin Mercier, session 494 StochBuild B, Z 5Ground Floor3x20 min

Sakina Melloul, Flexible Multi-choiceGoal Programming with Fuzzy Data

Kerstin Lux, Optimal inflow control insupply systems with uncertain demands

Quentin Mercier, A descent algorithmfor stochastic multiobjective optimizationproblems

Salle 37 Robust Combinatorial Optimization II, Organizer: Agostinho Agra, session 168 RobustBuild B, Z 4Intermediate4x20 min

Ayse Arslan, Robust Strategic Planning ofPhytosanitary Treatments in Agriculture

Marco Silva, Exact Solution Algorithmsfor the Robust Total Tardiness Problem

Agostinho Agra, A Lagrangean dualmodel for the robust inventory problem

Yasaman Mozafari, Robust ExpansionPlanning of Interdependent Electricity,Gas, and Heat

Salle 33 Wasserstein Distributionally Robust Optimization, Organizer: Peyman Mohajerin Esfaha, session 448 RobustBuild B, Z 5Ground Floor3x30 min

Viet Anh Nguyen, Risk-Averse Optimiza-tion over Structured Wasserstein Ambigu-ity Set

Jose Blanchet, Wasserstein DRO: Mod-eling and Optimal Choice of UncertaintySize

Peyman Mohajerin Esfaha, Data-drivenInverse Optimization with Imperfect Infor-mation

Salle 31 Tractability and approximation algorithms in dynamic programming,Chair: Alexander V. Hopp, session 383

Markov

Build B, Z 5Ground Floor3x30 min

Yann Dujardin, Sample-Based Approx-imate GMDP Solution with TheoreticalGuarantees

Giacomo Nannicini, An FPTAS forstochastic DPs with multidimensionalaction and scalar state

Alexander Hopp, On Friedmann’s subex-ponential lower bound for Zadeh’s pivotrule

66

Room Continuous Optimization - Friday 5:00 PM – 6:30 PMGINTRAC Moment relaxations for polynomial optimization with symmetries,

Organizer: Markus Schweighofer, session 10NLP

Build Q, Z 8Ground Floor3x30 min

Frank Vallentin, Coloring the Voronoitessellation of lattices

CordianRiener, Semidefinite optimizationand arithmetic progressions

Philippe Moustrou, The upper density ofsets avoiding norm one in the real space ofdimension n

Salle KC7 Subspace methods in NLP II, Organizer: Panos Parpas, session 44 NLPBuild K, Z 10Intermediate 23x30 min

Panos Parpas, Distributed Subspace De-composition

Emre Mengi, Subspace Frameworks forEigenvalue Optimization

Jaroslav Fowkes, A block-coordinateGauss-Newton method for nonlinear leastsquares

Salle 05 Primal-dual and ADMM algorithms for nonlinear programming,Organizer: Marco Sciandrone, session 91

NLP

Build Q, Z 111st floor4x20 min

Ahmet Alacaoglu, Smooth Primal-DualCoordinate Descent for Nonsmooth Con-vex Optimization

N. Serhat Aybat, A primal-dual algorithmfor general convex-concave saddle pointproblems

Mario Figueiredo, ADMM with Plug-and-Play Regularizers: Convergence Guaran-tees and Applications

Giulio Galvan, Alternating minimizationmethods for constrained nonconvex opti-mization

Salle 9 Linear Optimization I, Chair: Jianming Shi, session 415 NLPBuild N, Z 124th floor3x20 min

Zhize Li, A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Pro-gramming

Jianming Shi, A polarity-based algorithmfor solving linear programming problems

Maxim Demenkov, An algorithm for linearprogramming based on the projection ontoa zonotope

Salle 20 Global Optimization 1, Chair: Jean-Baptist Hiriart-Urruty, session 501 GlobalBuild G, Z 61st floor3x30 min

Fabio Schoen, New clustering methods forlarge scale global optimization

Sergiy Butenko, Continuous Approachesto Cluster-Detection Problems in Networks

Julio Gonzalez-Diaz, Computational ad-vances in the RLT algorithms: A freelyavailable implementation

Salle 8 Nonsmooth DC optimization with applications, Chair: Napsu Karmitsa, session 46 NonSmoothBuild N, Z 124th floor3x30 min

Sona Taheri, PIECEWISE LINEAR RE-GRESSION VIA NONSMOOTH DC OP-TIMIZATION

Kaisa Joki, Double Bundle Method forNonsmooth DC Optimization

Napsu Karmitsa, Support vector machinesfor clusterwise linear regression

Salle LC4 Nonconvex Optimization: Theory and Methods - Part 3, Organizer: Genaro Lopez, session 188 NonSmoothBuild L, Z 9Intermediate 13x30 min

Alexander Shtof, Globally Solving aClass of Optimal Power Flow Problems inRadial Networks

Matthew Tam, Algorithms based onunions of nonexpansive maps

Genaro Lopez, What do ‘convexities’ im-ply on Hadamard manifolds?

Salle AURIAC Computer-assisted analyses of optimization algorithms II, Organizer: Adrien Taylor, session 16 SDPBuild G, Z 61st floor3x30 min

EtienneDeKlerk, SDP performance anal-ysis of inexact Newton-type methods forself-concordant func

Riley Badenbroek, A Universal InteriorPoint Method Using Hit-and-Run Sam-pling

Adrien Taylor, Worst-case analyses ofstochastic gradient-based methods usingSDPs

Salle LC5 Sparse Semidefinite Programming, Organizer: Somayeh Sojoudi, session 17 SDPBuild L, Z 10Intermediate 13x30 min

Martin Andersen, Sparse SemidefiniteRelaxations of Communicability-BasedGraph Partition Problem

Cedric Josz, Lasserre hierarchy for largescale polynomial optimization

Somayeh Sojoudi, Fast Algorithms forMax-Det Matrix Completion and Graphi-cal Lasso

Salle 06 Nonlinear Optimization and Variational Inequalities IV, Organizer: Cong Sun, session 144 VariatBuild Q, Z 111st floor3x30 min

Junfeng Yang, A TVSCAD approach forimage deblurring with impulsive noise

Chengjing Wang, A semismooth Newtonbased augmented Lagrangian method forsolving SVM problems

Chao Ding, Matrix optimization in datascience: recent progress on algorithmfoundation

Salle ARNOZAN Variational Analysis 2, Organizer: David Salas, session 367 VariatBuild Q, Z 8Ground Floor4x20 min

Ba Khiet Le, Maximal Monotonicity Aris-ing in Nonsmooth Lur’e Dynamical sys-tems

Emilio Vilches, Lyapunov pairs for per-turbed sweeping processes

Parin Chaipunya, Proximal Algorithms inHadamard Spaces

David Salas, Quasi-Variational Inequalityproblems over product sets

Salle KC6 Algorithms for Structured Statistical Optimization, Chair: Ilker Birbil, session 349 RandomMBuild K, Z 10Intermediate 14x20 min

Ilker Birbil, A Differentially PrivateStochastic Gradient Descent Algorithmwith Smoothing

Lijun Ding, Leave-one-out approach forstatistical optimization

GregOngie, Adaptive Sampling for OnlineSubspace Estimation

Saeed Ghadimi, Approximation Methodsfor Bilevel Programming

Salle 21 Derivative-free global optimization algorithms, Chair: Zaikun Zhang, session 41 DerFreeBuild G, Z 6Intermediate2x30 min

Limeng Liu, Optimization with globalsurrogate and trust-region assisted localsearch

Anne Auger, Benchmarking Bayesian,Derivative-Free, and Stochastic BlackboxAlgorithms

67

Room Specific Models, Algorithms, and Software - Friday 5:00 PM – 6:30 PMFABRE Spectral and Semidefinite Methods for Learning, Organizer: Martin Jaggi, session 321 LearningBuild J, Z 8Ground Floor4x20 min

Maryam Fazel, Competitive Online Algo-rithms with Application to Optimal Exper-iment Design

Michael Fanuel, Positive semi-definiteembedding for dimensionality reduction

Kimon Fountoulakis, Variational Perspec-tive on Local Graph Clustering

Saverio Salzo, Solving lp-norm regular-ization with tensor kernels

Salle 18 Transportation networks, Chair: Bernard Gendron, session 359 NetworkBuild I, Z 71st floor4x20 min

Parisa Charkhgard, The network mainte-nance problem

Yasufumi Saruwatari, Airspace sectoriza-tion by set-partitioning approach

Bin Li, Joint Transceiver Optimization forWireless Information and Energy Transfer

Bernard Gendron, Node-Based La-grangian Relaxations for MulticommodityNetwork Design

Salle 16 Logistics Networks, Chair: El Hassan Laaziz, session 468 LogisticsBuild I, Z 72nd floor2x20 min

Yasushi Narushima, Robust supply chainnetwork equilibrium model with randomdemands

Guillaume Marques, Method Benchmark-ing for Two-Echelon Capacitated VehicleRouting

Salle 23 Energy-aware planning and scheduling 2, Organizer: Christian Artigues, session 178 EnergyBuild G, Z 63rd floor3x30 min

Paul Javal, Modelling uncertainties inshort-term operational planning optimiza-tion

Aurelien Froger, Solving an electric ve-hicle routing problem with capacitatedcharging stations

Christian Artigues, Polyhedral approachfor a continuous energy-constrainedscheduling problem

Salle 24 Stochastic Methods for Energy Optimization, Chair: Tristan Rigaut, session 294 EnergyBuild G, Z 63rd floor3x20 min

Clara Lage, Stabilization of Price Signalsin Energy Optimization

Guilherme Matiussi Ramalho, Stochas-tic Unit Commitment Problem: an ExactProbabilistic Constrained Approach

Tristan Rigaut, Long term management ofenergy storage using stochastic optimiza-tion

Salle LA4 Optimization and Game Theory, Organizer: Veerle Timmermans, session 402 SciencesBuild L, Z 8Basement4x20 min

Matthias Feldotto, Computing Approx-imate Pure Nash Equilibria in ShapleyValue Weighted Congestion

Cosimo Vinci, Dynamic taxes for polyno-mial congestion games

Bjoern Tauer, Competitive Packet Routing Veerle Timmermans, Equilibrium Compu-tation in Atomic Splittable PolymatroidCongestion Games

PITRES Computational Integer Programming II, Organizer: Domenico Salvagnin, session 274 AlgoBuild O, Z 8Ground Floor3x30 min

Gregor Hendel, Tighter LP relaxations forconfiguration knapsacks using extendedformulations

Dimitrios Letsios, Lexicographic Opti-mization and Recovery in Two-Stage Ro-bust Scheduling

Roland Wunderling, Dynamic Row Dis-ablement: a practical Implementation ofthe Kernel Simplex Method

68