Post on 02-Jul-2018
Room Salle 47 - Build A - 3rd floor - Zone 1Th Performance Analysis, Organizer: Charlotte Truchet8:30am-10:30am4x30 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
1
Room Salle 42 - Build C - 3rd floor - Zone 1We Primal Algorithms for Integer Programming Problems, Organizer: Daniel Aloise8:30am-10:30am4x30 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
Th Non-Standard IP Methods, Chair: Ulf Friedrich3:15pm-4:45pm3x30 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
Th Cutting Planes for Special Problems, Chair: Eleazar Madriz5:00pm-6:30pm3x30 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.
Fr Extended Formulations, Chair: Bartosz Filipecki3:15pm-4:45pm3x30 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
2
Room Salle 43 - Build C - 3rd floor - Zone 1Mo Provable guarantees for Cut Generating Functions, Organizer: Amitabh Basu3:15pm-4:45pm3x30 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
Mo Algorithms for matching markets, Organizer: Amin Saberi5:00pm-6:30pm4x20 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
Tu Extended formulations, Organizer: Stefan Weltge8:30am-10:30am4x30 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
Tu MIP under Uncertainty 2, Organizer: Simge Kucukyavuz3:15pm-4:45pm3x30 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.
We Determinantal structures of IPs, Organizer: Martin Henk8:30am-10:30am4x30 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
We Network Design and Routing, Chair: Yuko Kuroki3:15pm-4:45pm3x30 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
We IP-Formulations, Chair: Temitayo Ajayi5:00pm-6:30pm2x30 min
Wolfgang Riedl, The quadratic assign-ment problem: a comparison of two lin-earizations
Temitayo Ajayi, Assessing ParametrizedLinear Programming Relaxations With Su-peradditive Duality
Th Cycles and Trees, Organizer: Tobias Mömke8:30am-10:30am4x30 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
Th Polynomial Time Solvable Problems and Complete Descriptions, Chair: Andreas Bärmann3:15pm-4:45pm3x30 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
Th Advances in Integer Programming, Organizer: Robert Hildebrand5:00pm-6:30pm4x20 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
Fr Recent advances in Integer Optimization, Organizer: Alberto Del Pia8:30am-10:30am4x30 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
Fr Submodular and Incremental Maximization, Organizer: Martin Gross3:15pm-4:45pm3x30 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
Fr Algorithmic Discrepancy, Organizer: Nikhil Bansal5:00pm-6:30pm3x30 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
3
Room Salle 41 - Build C - 3rd floor - Zone 1Mo Scheduling with setup, uncertainty and precedences, Organizer: Monaldo Mastrolilli3:15pm-4:45pm3x30 min
Kim-Manuel Klein, Empowering theConfiguration-IP
Nicole Megow, Scheduling under Ex-plorable Uncertainty
Jose Verschae, Min-sum scheduling underprecedence constraints
Mo Practical aspects of network optimization, Chair: Kai Hoppmann5:00pm-6:30pm4x20 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
Tu Equilibrium Computation in Congestion Games, Organizer: Umang Bhaskar8:30am-10:30am4x30 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
Tu New developments in prophet inequalities and related settings, Organizer: Ruben Hoeksma3:15pm-4:45pm3x30 min
Ashish Chiplunkar, Prophet Inequalityand Prophet Secretary
Brendan Lucier, Prophets, Secretaries,and Prices
TimOosterwijk, Posted Prices and Thresh-old Strategies for Random Arrivals
We Discrete Convex Analysis, Organizer: Akiyoshi Shioura8:30am-10:30am4x30 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
We Variants of the Assignment problem, Organizer: Kavitha Telikepalli3:15pm-4:45pm3x30 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
We Connectivity problems and Steiner trees, Chair: Andreas E Feldmann5:00pm-6:30pm4x20 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
Th Graphs and clutters, Organizer: Gerard Cornuejols8:30am-10:30am4x30 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
Th Approximation algorithms for combinatorial optimization problems, Organizer: Thomas Rothvoss5:00pm-6:30pm3x30 min
Mohit Singh, Approximation Algorithmsfor Diverse Subset Selection Problems
Roy Schwartz, Local Guarantees in GraphCuts and Clustering
AnupamGupta, Scheduling Stochastic Jobson Unrelated Machines
Fr Recent progress in graph cut problems, Organizer: Karthekeyan Chandrasekaran8:30am-10:30am4x30 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
Fr Optimization problems in graphs and related, Chair: Claudio Arbib5:00pm-6:30pm4x20 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
4
Room Salle 44 - Build C - 3rd floor - Zone 1Mo IP Practice I, Chair: Maurice Queyranne3:15pm-4:45pm3x30 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
Mo Data Mining, Chair: Marcus V Poggi5:00pm-6:30pm4x20 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
Tu Machine Learning for Optimization, Organizer: Bistra Dilkina8:30am-10:30am4x30 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
Tu Symmetry Handling in Integer Programs, Organizer: Christopher Hojny3:15pm-4:45pm3x30 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
We Benders Decomposition for Combinatorial and Bilevel Optimization, Organizer: Fabio Furini8:30am-10:30am4x30 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
We Knapsack Problems, Organizer: Enrico Malaguti3:15pm-4:45pm3x30 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
We Exact Approaches for Vehicle Routing and Variants, Organizer: Ricardo Fukasawa5:00pm-6:30pm3x30 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
Th Advanced Linear(ized) MIP Formulations for Zero-One Programs, Organizer: Sven Mallach8:30am-10:30am4x30 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
Th Computational Issues in Integer Programming, Organizer: Ricardo Fukasawa3:15pm-4:45pm3x30 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
Th Cutting Planes, Chair: Fabrizio Marinelli5:00pm-6:30pm4x20 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
Fr Integer Programming and Crew Scheduling, Organizer: Francois Soumis8:30am-10:30am4x30 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
Fr Routing, Chair: Cole Smith3:15pm-4:45pm3x30 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
Fr Decomposition II, Chair: Natashia Boland5:00pm-6:30pm4x20 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
5
Room Salle 39 - Build E - 3rd floor - Zone 1Mo Exact Optimization Algorithms for Compressed Sensing, Organizer: Marc E Pfetsch3:15pm-4:45pm3x30 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
Mo Polynomial optimization in binary variables, Organizer: Elisabeth Rodriguez-Heck5:00pm-6:30pm3x30 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
Tu Exact approaches for problems over lattices and graphs, Chair: Daniele Catanzaro8:30am-10:30am4x30 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
Tu Submodular optimization and beyond, Chair: Satoru Iwata3:15pm-4:45pm3x30 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
We Optimization under uncertainty, Organizer: Marco Molinaro8:30am-10:30am4x30 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
We Polyhedral aspects of combinatorial optimization problems, Chair: Guillerme Duvillié3:15pm-4:45pm3x30 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
We Shortest paths and cutting stock, Chair: Arnaud Vandaele5:00pm-6:30pm4x20 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
Th Graph theory, Chair: Thomas Bellitto8:30am-10:30am4x30 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
Th Convexification and more (I), Organizer: Jon Lee3:15pm-4:45pm3x30 min
Marcia Fampa, Treating indefinitequadratic and bilinear forms in MINLP
Amelie Lambert, Valid inequalities forQCQPs
Luze Xu, More Virtuous Smoothing
Th Heuristics for combinatorial optimization problems, Chair: Evren Guney5:00pm-6:30pm4x20 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
Fr Algorithmic aspects of connectivity in network design, Organizer: Neil Olver8:30am-10:30am4x30 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
Fr Outer Convexification and Mixed-Integer Optimal Control , Organizer: Sebastian Sager3:15pm-4:45pm3x30 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
Fr Global Optimization for nonconvex MINLPs, Organizer: Hassan Hijazi5:00pm-6:30pm3x30 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
6
Room LEYTEIRE - Build E - 3rd floor - Zone 1Mo Geometry of Polynomials and Applications in Approximate Counting, Organizer: Shayan Oveis Gharan3:15pm-4:45pm3x30 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
Mo Scheduling and File Migration, Chair: Asaf Levin5:00pm-6:30pm3x30 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
Tu Streaming, Organizer: Michael Kapralov8:30am-10:30am4x30 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
Tu Algorithms in the Sharing Economy, Organizer: David Shmoys3:15pm-4:45pm3x30 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
We Approximation Algorithms for the Traveling Salesman Problem, Organizer: Anke van Zuylen8:30am-10:30am4x30 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
We Model-Based Methods, Sampling Models, and A New Second-Order Model-Based Method,Organizer: Stefan M Wild
11:00am-12:00am1x60 min
Luis Nunes Vicente, Model-Based Meth-ods, Sampling Models, and A NewSecond-Order Model-Based Method
We Clustering, Organizer: Mohammad R Salavatipour3:15pm-4:45pm3x30 min
Aravindan Vijayaraghavan, ClusteringMixtures of Well-Separated Gaussians
Konstantin Makarychev, CorrelationClustering
Melanie Schmidt, Analysis of Ward’smethod
We Approximation Algorithms for Geometric Packing Problems, Organizer: Fabrizio Grandoni5:00pm-6:30pm3x30 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
Th Submodular Maximization, Organizer: Moran Feldman8:30am-10:30am4x30 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
Th Approximation Algorithms for Clustering., Organizer: Deeparnab Chakrabarty3:15pm-4:45pm3x30 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
Th Approximation Algorithms for Optimization under Uncertainty, Organizer: Marc Uetz5:00pm-6:30pm3x30 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
Fr Data-Driven Revenue Management with Customer Choice, Organizer: Jacob Feldman8:30am-10:30am4x30 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
Fr Majority judgment , Organizer: Martine Labbé11:00am-12:00am1x60 min
Michel Balinski, Majority judgment
Fr Submodular Maximization., Organizer: Justin Ward3:15pm-4:45pm3x30 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
Fr Algorithmic Fairness and Optimization, Organizer: Nisheeth K Vishnoi5:00pm-6:30pm4x20 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
7
Room DURKHEIM - Build A - 3rd floor - Zone 1Mo Global Optimization, Organizer: Hassan Hijazi3:15pm-4:45pm3x30 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
Mo Mixed-Integer Conic Optimization, Organizer: Sven Wiese5:00pm-6:30pm3x30 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
Tu Graphical Optimization Model 1, Organizer: Joris Kinable8:30am-10:30am4x30 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
Tu Applications in Mixed-Integer Quadratic Programming, Organizer: Boshi Yang3:15pm-4:45pm3x30 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
We Learning in CP, Organizer: Arnaud Lallouet8:30am-10:30am4x30 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
We Decomposition methods for MINLP, Organizer: Ivo Nowak3:15pm-4:45pm3x30 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
We MINLP (III), Organizer: Daniel Bienstock5:00pm-6:30pm3x30 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
Th Parallel Computing and Sustainability, Organizer: Bistra Dilkina8:30am-10:30am4x30 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
Th Applications of CP, Organizer: Louis-Martin Rousseau3:15pm-4:45pm3x30 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
Th Convexification and more (II), Organizer: Akshay Gupte5:00pm-6:30pm3x30 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
Fr Graphical Optimization Model 2, Organizer: Maria I. Restrepo8:30am-10:30am4x30 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
Fr Intersection cuts, disjunctions, and valid inequalities, Organizer: Eli Towle3:15pm-4:45pm3x30 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
Fr Mixed-Integer PDE-Constrained Optimization , Organizer: Sven Leyffer5:00pm-6:30pm3x30 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
8
Room SIGALAS - Build C - 2nd floor - Zone 2Mo What’s happening in nonconvex optimization? A couple of stories, Organizer: Jean-Baptist Hiriart-Urruty1:30pm-2:30pm1x60 min
Emmanuel Candes, What’s happening innonconvex optimization? A couple of sto-ries
Mo On the Tree Augmentation Problem, Organizer: Laura Sanità3:15pm-4:45pm3x30 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
Mo Combinatorial optimization and convexity, Chair: Yu Yokoi5:00pm-6:30pm4x20 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
Tu Matching games and beyond, Organizer: Jochen Koenemann8:30am-10:30am4x30 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
Tu A.W. Tucker Prize Session, Chair: Simge Kucukyavuz3:15pm-4:45pmWe Stochastic optimization, Chair: Alexei A. Gaivoronski8:30am-10:30am4x30 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
We Logistics, Chair: Frieder Smolny3:15pm-4:45pm3x30 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
We Solvers and softwares, Chair: François Clautiaux5:00pm-6:30pm4x20 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
Th Energy, Chair: Kazem Abbaszadeh8:30am-10:30am4x30 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
Th Algorithms for TSP, Organizer: Ola Svensson3:15pm-4:45pm3x30 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
Th Planning, Chair: Jeanjean Antoine5:00pm-6:30pm4x20 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
Fr Matching and scheduling, Organizer: Seffi Naor8:30am-10:30am4x30 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
Fr Combinatorial aspects of Linear Programming, Organizer: Daniel Dadush3:15pm-4:45pm3x30 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
Fr Packing Steiner Trees, Organizer: Stephan Held5:00pm-6:30pm3x30 min
DirkMuller, Global Routing with TimingConstraints
Pietro Saccardi, Steiner Tree Packing inRhomboidal Tiles
Tilmann Bihler, Reach- and Direction-Restricted Rectilinear Steiner Trees
9
Room Salle 34 - Build B - 1st floor - Zone 3Mo Tight relaxations in nonconvex MINLP, Organizer: Ambros Gleixner3:15pm-4:45pm3x30 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
Mo Lattice methods in Integer Optimisation, Organizer: Iskander Aliev5:00pm-6:30pm3x30 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
Tu MIP under Uncertainty 1, Organizer: Fatma Kilinc-Karzan8:30am-10:30am3x30 min
Shabbir Ahmed, Distributionally RobustCombinatorial Optimization
Simge Kucukyavuz, Risk-Averse Set Cov-ering Problems
Ruiwei Jiang, Mixed-Integer Recourse viaPrioritization
Tu Convex relaxations in MINLP, Organizer: Adam N Letchford3:15pm-4:45pm3x30 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
We MINLP (I), Organizer: Daniel Bienstock8:30am-10:30am3x30 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
We MINLP (II), Organizer: Daniel Bienstock3:15pm-4:45pm3x30 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
We Robust Approaches for Challenging Uncertain Optimization Problems, Organizer: Frauke Liers5:00pm-6:30pm3x30 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
Th Integer linear programming, convex geometry, and lattices , Organizer: Sinai Robins8:30am-10:30am4x30 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
Th Heuristics in MINLP, Chair: Bertrand Travacca3:15pm-4:45pm3x30 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
Th Relaxations in MINLP, Chair: Jan Kronqvist5:00pm-6:30pm3x30 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
Fr Optimal Control Problems with Discrete Switches, Organizer: Christian Kirches8:30am-10:30am3x30 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
Fr Polyhedral theory in practice, Organizer: Mourad Baiou3:15pm-4:45pm3x30 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
Fr Machine Learning and Discrete Optimization, Organizer: Sebastian Pokutta5:00pm-6:30pm4x20 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
10
Room Salle 36 - Build B - Intermediate - Zone 4Mo Matching and Matroids, Organizer: José A Soto3:15pm-4:45pm3x30 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
Mo IP Practice II, Chair: Petra M. Bartmeyer5:00pm-6:30pm4x20 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
Tu Approximation Algorithms for Clustering, Organizer: Chaitanya Swamy8:30am-10:30am4x30 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
Tu Local Search and Facility Location, Organizer: Felix Willamowski3:15pm-4:45pm3x30 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
We Approximation Algorithms for Scheduling Problems, Organizer: Nicole Megow8:30am-10:30am4x30 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
We Decomposition I, Chair: Dieter Weninger3:15pm-4:45pm3x30 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
We Online Optimization, Organizer: Kevin Schewior5:00pm-6:30pm3x30 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
Th Bin Packing, Chair: Frits CR Spieksma8:30am-10:30am4x30 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
Th Routing and Inventory, Organizer: Dorit Hochbaum3:15pm-4:45pm3x30 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
Th Matching Problems, Organizer: Sergio García Quiles5:00pm-6:30pm4x20 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
Fr Clustering., Organizer: Zac Friggstad8:30am-10:30am4x30 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
Fr IP Practice III, Chair: Samuel S Brito3:15pm-4:45pm3x30 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
Fr Dual Ascent, Chair: Sara Maqrot5:00pm-6:30pm2x20 min
Stefania Pan, A dual ascent procedurefor solving the generalized set partitioningmodel
Sara Maqrot, Improving Wedelin’sHeuristic with Sensitivity Analysis for SetPartitioning
11
Room Salle 35 - Build B - Intermediate - Zone 4Mo MINLP methods in gas transport optimization (I), Organizer: Lars Schewe3:15pm-4:45pm3x30 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
Mo MINLP methods in gas transport optimization (II), Organizer: Lars Schewe5:00pm-6:30pm3x30 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
Tu Cutting Planes for Integer Programs, Chair: Matthias Köppe8:30am-10:30am4x30 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
Tu Applications of MINLP, Organizer: Dolores Romero Morales3:15pm-4:45pm3x30 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
We Advances in Integer Programming, Organizer: Santanu S Dey8:30am-10:30am4x30 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
We MINLP for Data Science, Organizer: Vanesa Guerrero3:15pm-4:45pm3x30 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
We Advances in MINLP, Organizer: Laura Palagi5:00pm-6:30pm3x30 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
Th Convexity and Polytopes, Chair: David Warme8:30am-10:30am4x30 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
Th MINLP with quadratic terms, Chair: Enrico Bettiol3:15pm-4:45pm3x30 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
Th Applications in MINLP, Chair: Justo Puerto5:00pm-6:30pm3x30 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
Fr Mixed Integer Programming Representability, Organizer: Juan Pablo Vielma8:30am-10:30am4x30 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
Fr Branch-and-cut techniques, Organizer: Teodora Dan3:15pm-4:45pm3x30 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
Fr Recent Advances and Applications of MINLP, Organizer: Jose M Ucha5:00pm-6:30pm3x30 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
12
Room Salle 37 - Build B - Intermediate - Zone 4Mo New models in robust optimization, Chair: Juan S Borrero5:00pm-6:30pm3x20 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
Tu Nonlinear Optimization with Uncertain Constraints, Organizer: Charlie Vanaret8:30am-10:30am3x30 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
We Interfaces of Applied Probability and Optimization, Organizer: Omar El Housni8:30am-10:30am4x30 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
We Cursing the Dimensionality: Two-Stage and Multi-Stage Robust Optimization,Organizer: Angelos Tsoukalas
3:15pm-4:45pm3x30 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
We Robust Adaptive Control and Learning, Organizer: Siqian Shen5:00pm-6:30pm2x30 min
Siqian Shen, Distributionally RobustAdaptive Control under NonstationaryUncertainty
Lauren Steimle, Leveraging stochasticprogramming to design robust policies forMarkov decision
Th K-adaptability, Organizer: Anirudh Subramanyam8:30am-10:30am4x30 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
Th Non-linear robust optimization, Chair: Laurent Alfandari3:15pm-4:45pm3x30 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
Th Combinatorial robust optimization I, Organizer: Marc Goerigk5:00pm-6:30pm4x20 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
Fr Robust Combinatorial Optimization II, Organizer: Agostinho Agra5:00pm-6:30pm4x20 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
13
Room Salle 30 - Build B - Ground Floor - Zone 5Mo Risk and Energy Markets, Chair: Julio Deride3:15pm-4:45pm3x30 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
Mo Differentiability, convexity, and modeling in stochastic optimization, Chair: Kai A. Spuerkel5:00pm-6:30pm3x20 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
Tu Algorithmic Game Theory I, Organizer: Luce Brotcorne8:30am-10:30am4x30 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
Tu Game Theory and Energy Markets, Chair: Didier Aussel3:15pm-4:45pm3x30 min
Anton Svensson, Constraint quali cationsfor parametrized optimization problemsand applications
Leonard vonNiederhausern, TrEMa: ATrilevel Energy Market Model
Didier Aussel, Electricity market modelwith elastic demand
We Risk and Financial Markets, Chair: Markku J Kallio8:30am-10:30am4x30 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
We Nonconvex and Complex Problems in Multiobjective Optimization, Chair: Gabriele Eichfelder3:15pm-4:45pm3x30 min
Gabriele Eichfelder, A Trust RegionMethod for Heterogeneous MultiobjectiveOptimization
Elizabeth Karas, Multiobjective program-ming via bundle methods
Tommaso Levato, Sparse multiobjectiveoptimization via concave approximations
We Aspects of Multiobjective Combinatorial Optimization, Organizer: Matthias Ehrgott5:00pm-6:30pm3x30 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
Th Stackelberg Games, Chair: Stefano Coniglio8:30am-10:30am4x30 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
Th Generation and Representation Algorithms in Multiobjective Optimization,Organizer: Michael Stiglmayr
3:15pm-4:45pm3x30 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
Th Topics in multistage stochastic optimization, Chair: Felipe Beltrán5:00pm-6:30pm3x20 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
Fr Algorithmic Game Theory II, Chair: Margarida Carvalho8:30am-10:30am4x30 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
Fr Scalarization, representation and the comparison of methods in Multiobjective Optimization,Chair: Tyler Perini
3:15pm-4:45pm3x30 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
Fr Topics in stochastic optimization, Chair: Quentin Mercier5:00pm-6:30pm3x20 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
14
Room Salle 31 - Build B - Ground Floor - Zone 5Mo Approximate dynamic programming, Organizer: David Brown3:15pm-4:45pm3x30 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
Mo Learning and dynamic programming, Chair: Boxiao Chen5:00pm-6:30pm2x30 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
Tu Algorithms for stochastic games : new approaches, Organizer: Hugo Gimbert8:30am-10:30am4x30 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
Tu Market places and dynamic programming, Chair: Dan A Iancu3:15pm-4:45pm3x30 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
We Dynamic programming applications, Chair: Susanne Hoffmeister3:15pm-4:45pm2x30 min
Susanne Hoffmeister, Markov DecisionProcesses for Sport Strategy Optimization
Paolo Serafini, A Model to evaluate thecost-effectiveness trade-off for urologictreatments
Th Approximation in dynamic programming, Chair: Philip C Placek5:00pm-6:30pm3x30 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
Fr Advances in theory of dynamic programming, Chair: Stephane L Gaubert8:30am-10:30am4x30 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
Fr Discrete stochastic dynamic programming, Chair: Adam Narkiewicz3:15pm-4:45pm3x30 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
Fr Tractability and approximation algorithms in dynamic programming, Chair: Alexander V. Hopp5:00pm-6:30pm3x30 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
15
Room Salle 32 - Build B - Ground Floor - Zone 5Mo Scenario discretization techniques in stochastic optimization, Organizer: Fabian Bastin3:15pm-4:45pm3x30 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
Mo Distributionally Robust Stochastic Programming: Theory and Applications, Organizer: Ran Ji5:00pm-6:30pm3x30 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
Tu Distributionally Robust and Stochastic Optimization: A Sampling/Scenario Perspective,Organizer: Guzin Bayraksan
3:15pm-4:45pm3x30 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
We Sampling and stability in stochastic optimization, Chair: Harsha Honnappa8:30am-10:30am3x30 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
We Learning and Stochastic Programming, Organizer: Matthias Poloczek3:15pm-4:45pm3x30 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
We Stochastic optimization models and applications, Chair: F.-Javier Heredia5:00pm-6:30pm4x20 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
Th Topics in multistage and integer stochastic optimization, Organizer: Jim Luedtke8:30am-10:30am4x30 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
Th Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 1,Organizer: Vincent Leclère
3:15pm-4:45pm3x30 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
Th Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 2,Organizer: Vincent Leclère
5:00pm-6:30pm4x20 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
Fr New methods for stochastic optimization and variational inequalities, Chair: Yunxiao Deng8:30am-10:30am4x30 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
Fr Risk-aware decision making, Organizer: Minseok Ryu3:15pm-4:45pm3x30 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
16
Room Salle 33 - Build B - Ground Floor - Zone 5Mo Distributionally Robust Optimization - New Theory and Applications, Organizer: Zhichao Zheng3:15pm-4:45pm3x30 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
Tu Robust Optimization and Operations Mangement, Organizer: Chaithanya Bandi8:30am-10:30am3x30 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
Tu Recent Advances in Robust Optimization I, Organizer: Phebe Vayanos3:15pm-4:45pm3x30 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
We Robust combinatorial optimization IV, Chair: Arie Koster8:30am-10:30am4x30 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
We Robust combinatorial optimization III, Organizer: Moritz Mühlenthaler5:00pm-6:30pm4x20 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
Th New applications of robust optimizations, Chair: Mirjam Duer8:30am-10:30am3x30 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
Fr New Horizons in Robust Optimization, Organizer: Angelos Georghiou8:30am-10:30am3x30 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
Fr Distributionally Robust Optimization: Models and Applications, Organizer: Selin D Ahipasaoglu3:15pm-4:45pm3x30 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
Fr Wasserstein Distributionally Robust Optimization, Organizer: Peyman Mohajerin Esfaha5:00pm-6:30pm3x30 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
17
Room DENIGES - Build C - Ground Floor - Zone 5Mo Theoretical Analysis of Cutting-Planes in IP Solvers., Organizer: Gerard Cornuejols1:30pm-2:30pm1x60 min
Santanu Dey, Theoretical Analysis ofCutting-Plane Selection in IP Solvers.
Mo Preference robust optimization, Organizer: Erick Delage3:15pm-4:45pm3x30 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
Mo Advances in Adjustable Robust Optimization, Organizer: Do Young Yoon5:00pm-6:30pm3x30 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
Tu Risk-averse stochastic programming, Organizer: Andrzej Ruszczynski8:30am-10:30am4x30 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
Tu Asymptotic Lagrangian duality for nonsmooth optimization, Organizer: Xiaojun Chen11:00am-12:00am1x60 min
Regina Burachik, Asymptotic Lagrangianduality for nonsmooth optimization
Tu Recent Advances in Robust Optimization II, Organizer: Wolfram Wiesemann3:15pm-4:45pm3x30 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
We Chance Constraint and Its Applications, Organizer: Jianqiang Cheng8:30am-10:30am4x30 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
We Online Competitive Algorithms for Resource Allocation, Organizer: Frank E. Curtis11:00am-12:00am1x60 min
Maryam Fazel, Online Competitive Algo-rithms for Resource Allocation
We Dynamic Optimization: Theory and Algorithms, Organizer: Vineet Goyal3:15pm-4:45pm3x30 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
We Stochastic Programming and Distributionally Robust Optimization Models with EndogenousUncertainty, Organizer: Miguel Lejeune
5:00pm-6:30pm3x30 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
Th New results in chance-constrained optimization, Chair: Bismark Singh8:30am-10:30am4x30 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
Th Effective Scenarios and Scenario Reduction for Risk-Averse Stochastic Programs, Organizer: Jim Luedtke11:00am-12:00am1x60 min
Tito Homem-de-Mello, Effective Scenar-ios and Scenario Reduction for Risk-Averse Stochastic Programs
Th Distributionally Robust Optimization With Marginals and Cones, Organizer: Divya Padmanabhan3:15pm-4:45pm3x30 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
Th Robust Optimization under Data Uncertainty, Organizer: Omid Nohadani5:00pm-6:30pm3x30 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
Fr Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 3,Organizer: Vincent Leclère
8:30am-10:30am4x30 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
Fr Submodularity in mixed-integer quadratic and conic quadratic optimization,Organizer: Daniel Bienstock
11:00am-12:00am1x60 min
Alper Atamturk, Submodularity inmixed-integer quadratic and conicquadratic optimization
Fr Distributionally Robust Optimization, Organizer: Daniel Kuhn3:15pm-4:45pm3x30 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
18
Room Salle 22 - Build G - 2nd floor - Zone 6Mo Implementation of interior-point methods for large-scale problems and applications I,
Organizer: Jordi Castro3:15pm-4:45pm2x30 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
Mo Sparsity, variable selection and efficient algorithms, Chair: Alex Sholokhov5:00pm-6:30pm4x20 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
Tu Pricing, Chair: Anastasiya Ivanova8:30am-10:30am4x30 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
Tu Learning for mixed integer optimization, Chair: Hari Bandi3:15pm-4:45pm2x30 min
Hari Bandi, Learning a Mixture of Gaus-sians via Mixed Integer Optimization
Takanori Maehara, Learning for TuningParameters of NUOPT MILP Solver
We Numerically Efficient Methods for Piecewise Algorithmic Differentiation I, Organizer: Torsten F Bosse8:30am-10:30am4x30 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
We Structure Detection in Integer Programming, Organizer: Taghi Khaniyev3:15pm-4:45pm3x30 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
We Large-scale convex optimization, Chair: Alexander V. Rogozin5:00pm-6:30pm2x20 min
Alexander Rogozin, Optimal distributedconvex optimization on slowly time-varying graphs
Tommaso Colombo, Leverage data struc-ture to improve Stochastic Gradient De-scent algorithm
Th Numerically Efficient Methods for Piecewise Algorithmic Differentiation II, Organizer: Torsten F Bosse8:30am-10:30am4x30 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
Th High-Performance Computing in Optimization II, Chair: Joaquim Dias Garcia3:15pm-4:45pm3x30 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
Th Ranking and recommendation, Chair: Aleksandra Burashnikova5:00pm-6:30pm4x20 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
Fr New Developments in Optimization Modeling Software, Organizer: Robert Fourer8:30am-10:30am4x30 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
Fr Optimization in Energy, Chair: Andrea Simonetto3:15pm-4:45pm3x30 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
19
Room Salle AURIAC - Build G - 1st floor - Zone 6Mo Theory and Methods for ODE- and PDE-Constrained Optimization 1, Chair: Carl M Greiff3:15pm-4:45pm3x30 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
Mo Advances in optimization methods for time dependent problems:I, Organizer: Matthias Heinkenschloss5:00pm-6:30pm4x20 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
Tu Optimization Methods for PDE Constrained Problems , Organizer: Michael Ulbrich8:30am-10:30am4x30 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
Tu Optimal Control and PDE Constrained Optimization, Organizer: Hasnaa Zidani3:15pm-4:45pm3x30 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
We Recent Advances in Conic Programming II, Organizer: Sena Safarina8:30am-10:30am4x30 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
We Risk-Averse PDE-Constrained Optimization–Methods and Applications, Organizer: Harbir Antil3:15pm-4:45pm3x30 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
We Advances in optimization methods for time dependent problems II, Organizer: Denis Ridzal5:00pm-6:30pm4x20 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
Th Optimal Control of Variational Inequalities and Complementarity Systems, Chair: Alexandre Vieira8:30am-10:30am4x30 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
Th Theory and Methods for ODE- and PDE-Constrained Optimization 2, Chair: Johann Schmitt3:15pm-4:45pm2x30 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
Th Recent Advances in Conic Programming III, Organizer: Masakazu Muramatsu5:00pm-6:30pm4x20 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
Fr Optimal Control in Engineering Applications, Chair: Maxime Grangereau8:30am-10:30am3x30 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
Fr Computer-assisted analyses of optimization algorithms II, Organizer: Adrien Taylor5:00pm-6:30pm3x30 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
20
Room Salle 23 - Build G - 3rd floor - Zone 6Mo Combinatorial Optimization in Chip Design, Organizer: Stefan Hougardy3:15pm-4:45pm3x30 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
Mo Novel data-driven OR techniques for power system operations and planning, Organizer: Juan M. Morales5:00pm-6:30pm3x30 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
Tu Electric Vehicles and Decarbonization, Chair: Martim Joyce-Moniz8:30am-10:30am4x30 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
Tu Supply Chain and Lot Sizing, Chair: Simon Thevenin3:15pm-4:45pm3x30 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
We Energy-aware planning and scheduling 1, Organizer: Sandra U. Ngueveu8:30am-10:30am4x30 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
We Conic Optimization and Power Systems, Organizer: Jakub Marecek3:15pm-4:45pm3x30 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
We Energy Market Models, Chair: Sauleh A Siddiqui5:00pm-6:30pm3x30 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
Th Unit Commitment Problem and Applications, Organizer: Tiziano Parriani8:30am-10:30am4x30 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
Th Progress in Algorithms for Optimal Power Flow Problems II, Chair: Miguel F Anjos3:15pm-4:45pm3x30 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
Th Gas Network and Market Optimization, Organizer: Jonas Schweiger5:00pm-6:30pm3x30 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
Fr Scheduling Applications, Chair: Mauricio C. de Souza8:30am-10:30am3x30 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
Fr Optimization for Energy System Planning, Chair: Andrew Lu Liu3:15pm-4:45pm3x30 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
Fr Energy-aware planning and scheduling 2, Organizer: Christian Artigues5:00pm-6:30pm3x30 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
21
Room Salle 21 - Build G - Intermediate - Zone 6Mo Mixed-integer derivative-free optimization, Chair: Clément Royer3:15pm-4:45pm3x30 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
Mo Advances in DFO I, Chair: Sébastien Le Digabel5:00pm-6:30pm3x30 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
Tu Bayesian and Randomized Optimization II, Chair: Youssef Diouane8:30am-10:30am4x30 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
Tu Advances in DFO II, Chair: Warren Hare3:15pm-4:45pm3x30 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
We New derivative-free algorithms, Chair: Margherita Porcelli8:30am-10:30am4x30 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
We Surrogate-based algorithms for constrained derivative-free problems, Chair: Phillipe R. Sampaio3:15pm-4:45pm3x30 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
We Progress in methods and theory of derivative-free optimization, Chair: Serge Gratton5:00pm-6:30pm3x30 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
Th Bayesian and Randomized Optimization I, Chair: Stefan M Wild8:30am-10:30am4x30 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
Th Advances in DFO III, Chair: Juan C Meza5:00pm-6:30pm3x30 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
Fr Challenging applications in DFO, Chair: Francesco Rinaldi8:30am-10:30am4x30 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
Fr Advances in DFO IV, Chair: Katya Scheinberg3:15pm-4:45pm3x30 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
Fr Derivative-free global optimization algorithms, Chair: Zaikun Zhang5:00pm-6:30pm2x30 min
Limeng Liu, Optimization with globalsurrogate and trust-region assisted localsearch
Anne Auger, Benchmarking Bayesian,Derivative-Free, and Stochastic BlackboxAlgorithms
22
Room Salle 20 - Build G - 1st floor - Zone 6Mo Using SDP relaxations and solving them faster, Organizer: Elisabeth Gaar3:15pm-4:45pm3x30 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
Mo Solving large scale convex composite programming, Organizer: Kim-Chuan Toh5:00pm-6:30pm3x30 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
Tu Algebraic and geometric aspects of semidefinite programming, Organizer: Hamza Fawzi8:30am-10:30am4x30 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
Tu Recent Advances in Conic Programming I, Organizer: Makoto Yamashita3:15pm-4:45pm3x30 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
We Theory and algorithms in conic linear programming 2, Organizer: Gabor Pataki8:30am-10:30am4x30 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
We SDP approaches to combinatorial and global optimization problems, Organizer: Etienne De Klerk3:15pm-4:45pm3x30 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
We Noncommutative polynomial optimization: semidefinite relaxations, free convexity and applications toquantum information I, Organizer: Monique Laurent
5:00pm-6:30pm3x30 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
Th Computer-assisted analyses of optimization algorithms I, Organizer: Adrien Taylor8:30am-10:30am4x30 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
Th Global Optimization 3, Chair: Jean-Baptist Hiriart-Urruty5:00pm-6:30pm4x20 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
Fr Copositive and completely positive optimization, Organizer: Olga Kuryatnikova8:30am-10:30am4x30 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
Fr Global Optimization 2, Chair: Mirjam Duer3:15pm-4:45pm3x30 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
Fr Global Optimization 1, Chair: Jean-Baptist Hiriart-Urruty5:00pm-6:30pm3x30 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
23
Room Salle 24 - Build G - 3rd floor - Zone 6Mo Topics in power systems, Organizer: Alberto J Lamadrid3:15pm-4:45pm3x30 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
Mo Structure and Learning in Power Grid Optimization, Organizer: Deepjyoti Deka5:00pm-6:30pm3x30 min
Gal Dalal, Chance-Constrained OutageScheduling using a Machine LearningProxy
Sidhant Misra, Statistical Learning ForDC Optimal Power Flow
Apurv Shukla, Non-Stationary StreamingPCA
Tu Risk Models for Electricity Markets, Chair: Michael C Ferris8:30am-10:30am4x30 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
Tu Optimization Models for Renewable Energy Integration 2, Chair: Michel Denault3:15pm-4:45pm3x30 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
We Distribution and Demand Flexibility, Chair: Golbon Zakeri8:30am-10:30am4x30 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
We Emerging Energy Markets, Organizer: Dennice F. Gayme3:15pm-4:45pm2x30 min
Maryam Kamgarpour, Designingcoalition-proof mechanisms - the caseof electricity markets
Sean Meyn, Irrational Agents and thePower Grid
We Location and Routing, Chair: Mustapha Oudani5:00pm-6:30pm4x20 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
Th Mining Applications, Organizer: Alexandra M Newman8:30am-10:30am4x30 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
Th Electricity Generation Scheduling and Dispatch, Chair: Christophe Duhamel3:15pm-4:45pm3x30 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
Th Vehicle Routing III, Chair: Raquel Bernardino5:00pm-6:30pm3x20 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
Fr Power Systems Models with Discrete Decision Variables, Organizer: Adolfo R Escobedo8:30am-10:30am3x30 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
Fr Vehicle Routing II, Chair: Chris N Potts3:15pm-4:45pm3x30 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
Fr Stochastic Methods for Energy Optimization, Chair: Tristan Rigaut5:00pm-6:30pm3x20 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
24
Room Salle 18 - Build I - 1st floor - Zone 7Mo Advances in Linear, Non Linear and Mixed-Integer Optimization, Chair: Hiroshige Dan3:15pm-4:45pm3x30 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
Mo Manufacturing, Chair: Younsoo Lee5:00pm-6:30pm4x20 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
Tu Path and tree problems, Chair: Arthur J Delarue8:30am-10:30am4x30 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
Tu Optimization software and applications, Chair: Bartolomeo Stellato3:15pm-4:45pm3x30 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
We Robust network optimization, Organizer: Dimitri Papadimitriou8:30am-10:30am4x30 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)
We Scheduling in Networks, Chair: Hamish Waterer3:15pm-4:45pm3x30 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
We Machine Scheduling 2, Chair: Guopeng Song5:00pm-6:30pm3x20 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
Th High-Performance Computing in Optimization I, Organizer: Kibaek Kim8:30am-10:30am3x30 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
Th Production Planning, Chair: Michel Siemon3:15pm-4:45pm3x30 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
Th Supply Chain, Chair: Daniel Ramón-Lumbierres5:00pm-6:30pm4x20 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
Fr Telecommunications, Organizer: Edoardo Amaldi8:30am-10:30am4x30 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
Fr Machine Scheduling 1, Chair: Renan S. Trindade3:15pm-4:45pm3x30 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
Fr Transportation networks, Chair: Bernard Gendron5:00pm-6:30pm4x20 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
25
Room Salle 16 - Build I - 2nd floor - Zone 7Mo Decisions and learning from data, Chair: Christopher McCord3:15pm-4:45pm3x30 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
Mo Packing and Capacity Management, Chair: Eugene Zak5:00pm-6:30pm3x20 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
Tu Facility Location, Chair: Ivan Contreras8:30am-10:30am3x30 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
Tu Distributed and Asynchronous Learning, Organizer: Ion Necoara3:15pm-4:45pm3x30 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
We First-Order Methods for Machine Learning, Organizer: Fabian Pedregosa8:30am-10:30am3x30 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
We Rail and Maritime Transportation, Chair: Kazuhiro Kobayashi3:15pm-4:45pm3x30 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
We Production-Routing, Chair: Feng Gao5:00pm-6:30pm3x20 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
Th Dynamical systems, control and optimization, Chair: Benjamin Recht8:30am-10:30am4x30 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
Th Robust first order methods, Organizer: Fatma Kilinc-Karzan3:15pm-4:45pm3x30 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
Th Advances in Reinforcement Learning Algorithms, Organizer: Lin Xiao5:00pm-6:30pm4x20 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
Fr Dealing with non-convexity, Chair: Damek Davis8:30am-10:30am4x30 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
Fr Discrete methods for data centers and graphs, Organizer: Aaron Archer3:15pm-4:45pm3x30 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
Fr Logistics Networks, Chair: El Hassan Laaziz5:00pm-6:30pm2x20 min
Yasushi Narushima, Robust supply chainnetwork equilibrium model with randomdemands
Guillaume Marques, Method Benchmark-ing for Two-Echelon Capacitated VehicleRouting
26
Room Salle LA4 - Build L - Basement - Zone 8Mo Portfolio Optimization, Chair: Bernardo K. Pagnoncelli3:15pm-4:45pm3x30 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
Mo Structure from evidence, Organizer: Peter Gritzmann5:00pm-6:30pm3x30 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
Tu Interval Global Optimization, Organizer: Frederic Messine8:30am-10:30am4x30 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
Tu Optimization in Medicine, Organizer: Sebastian Sager3:15pm-4:45pm3x30 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
We Energy markets, Organizer: Martine Labbé8:30am-10:30am3x30 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
We Air Transportation and Air Traffic Management, Organizer: Sonia Cafieri3:15pm-4:45pm3x30 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
We Resource-constrained assignment and scheduling, Organizer: Fabian Bastin5:00pm-6:30pm3x30 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
Th Multi-commodity flows, Organizer: Ralf Borndörfer8:30am-10:30am4x30 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
Th Inverse Problems in Physics, Chair: Leo Liberti3:15pm-4:45pm3x30 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
Th Medicine and Metabolic engineering, Chair: Mahdi Doostmohammadi5:00pm-6:30pm4x20 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
Fr Finance and Portfolio Optimization, Organizer: Asaf Shupo8:30am-10:30am3x30 min
Benjamin Heymann, Auction under ROIconstraints
Gabriela Kovacova, Time Consistency ofthe Mean-Risk Problem
Asaf Shupo, Building Optimal StrategiesUsing Multi-Objective Optimization
Fr Industrial dynamics and Environmental policy, Organizer: Inmaculada Garcia Fernandez3:15pm-4:45pm3x30 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
Fr Optimization and Game Theory, Organizer: Veerle Timmermans5:00pm-6:30pm4x20 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
27
Room Salle ARNOZAN - Build Q - Ground Floor - Zone 8Mo Algorithms for optimization and variational problems with possibly nonisolated solutions I,
Organizer: Andreas Fischer3:15pm-4:45pm3x30 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
Mo Variational Analysis 4, Organizer: Jo A. Brueggemann5:00pm-6:30pm4x20 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
Tu Optmization Algorithms and Variational Inequalites I, Organizer: Bo Jiang8:30am-10:30am4x30 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
We Variational Analysis 1, Organizer: Samir Adly8:30am-10:30am4x30 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.
We Nash equilibrium and games 1, Organizer: Lorenzo Lampariello3:15pm-4:45pm3x30 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
We Interior Point Methods in LP and NLP, Chair: Andre L Tits5:00pm-6:30pm3x30 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
Th First-order methods: advances and applications, Organizer: Immanuel M. Bomze8:30am-10:30am4x30 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
Th Variational Analysis 5, Organizer: David Sossa5:00pm-6:30pm4x20 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
Fr Variational Analysis 3, Organizer: Johanna Burtscheidt8:30am-10:30am4x30 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
Fr Nash equilibrium and Games 2, Organizer: Giancarlo Bigi3:15pm-4:45pm3x30 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
Fr Variational Analysis 2, Organizer: David Salas5:00pm-6:30pm4x20 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
28
Room FABRE - Build J - Ground Floor - Zone 8Mo Distributed Optimization, Organizer: Franck Iutzeler3:15pm-4:45pm3x30 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
Mo Riemannian geometry in optimization for learning, Organizer: Nicolas Boumal5:00pm-6:30pm4x20 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
Tu Optimization in Statistical Learning, Organizer: Quentin Berthet8:30am-10:30am4x30 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
Tu Advances in large-scale machine learning, Organizer: Mark Schmidt3:15pm-4:45pm3x30 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
We Structured Optimization for Machine Learning and Signal Processing, Organizer: Lin Xiao8:30am-10:30am4x30 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
We Convex optimization, distances and constraints, Chair: Pablo A Parrilo3:15pm-4:45pm3x30 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
We Problems in the intersection of machine learning and optimization, Chair: Ross M Anderson5:00pm-6:30pm3x30 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
Th First-order methods for large-scale convex problems, Organizer: Stephen A Vavasis8:30am-10:30am4x30 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
Th Accelerating Learning, Organizer: Martin Takac3:15pm-4:45pm3x30 min
Damien Scieur, Nonlinear Acceleration ofStochastic Algorithms
Sai Praneeth Karimireddy, AcceleratedFirst Order Methods with ApproximateSubproblems
Angelia Nedich, Optimal Algorithms forDistributed Optimization
Th First-order methods for large-scale convex problems II, Organizer: Stephen A Vavasis5:00pm-6:30pm4x20 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
Fr Dimensionality reduction tools for learning: A sketchy session, Organizer: Robert M Gower8:30am-10:30am3x30 min
Nicolas Keriven, Sketched Learning withRandom Feature Moments
Arthur Mensch, Stochastic Subsamplingfor Factorizing Huge Matrices
Alessandro Rudi, Optimal kernel methodsfor large scale machine learning
Fr Classification, regression and clustering, Chair: Dimitris Bertsimas3:15pm-4:45pm3x30 min
Dimitris Bertsimas, Interpretable MachineLearning
InacioGuimaraes, Logistic Regression andPrincipal Curves Applied to DiscriminantAnalysis
James Brooks, Sufficient Conditions forL1-Norm Best-Fit Lines
Fr Spectral and Semidefinite Methods for Learning, Organizer: Martin Jaggi5:00pm-6:30pm4x20 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
29
Room Salle DENUCE - Build Q - Ground Floor - Zone 8Mo Progress in Algorithms for Optimal Power Flow Problems I, Organizer: Miguel F Anjos3:15pm-4:45pm3x30 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
Mo Exploiting structure in constrained optimization, Organizer: Mihai Cucuringu5:00pm-6:30pm4x20 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
Tu Statistics meets optimization: going beyond convexity, Organizer: John Duchi8:30am-10:30am4x30 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
Tu Equilibrium Modelling in Energy, Organizer: Thomas Kallabis3:15pm-4:45pm3x30 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
We Decomposition Techniques to Solve Large-Scale Optimization Problems for Electricity and Natural GasSystems, Organizer: Ramteen Sioshansi
8:30am-10:30am4x30 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
We Second order methods for training ML models, Chair: Julien Mairal3:15pm-4:45pm3x30 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
We Optimization and modeling of integrated energy systems, Organizer: Jalal Kazempour5:00pm-6:30pm4x20 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
Th Large-scale learning, Organizer: Lorenzo Rosasco8:30am-10:30am4x30 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
Th Optimization Models for Renewable Energy Integration 1, Organizer: Luis F Zuluaga3:15pm-4:45pm3x30 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
Th Equilibrium and Optimization in Energy Markets, Organizer: Asgeir Tomasgard5:00pm-6:30pm3x30 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
Fr Machine Learning in State Estimation and Situational Awareness in Power Grids,Organizer: Deepjyoti Deka
8:30am-10:30am4x30 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
Fr Estimation and Learning for Power Systems, Organizer: Javad Lavaei3:15pm-4:45pm3x30 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
30
Room PITRES - Build O - Ground Floor - Zone 8Mo Facility Layout, Chair: Anders N Gullhav3:15pm-4:45pm3x30 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
Mo Implementation of interior-point methods for large-scale problems and applications II,Organizer: Jordi Castro
5:00pm-6:30pm3x30 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
Tu LP, Mixed Integer Convex Programming and Decomposition, Organizer: Thorsten Koch8:30am-10:30am4x30 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
Tu Pricing Methods, Organizer: Rafael Martinelli3:15pm-4:45pm3x30 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
We Progress in MIP Solvers I, Organizer: Michael Winkler8:30am-10:30am3x30 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
We Progress in Conic and MIP Solvers, Organizer: Imre Polik3:15pm-4:45pm3x30 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
We Progress in MIP Solvers II, Organizer: Hans Mittelmann5:00pm-6:30pm3x30 min
Andrea Tramontani, Benders Decomposi-tion in IBM CPLEX
Michael Winkler, Gurobi 8.0 - What’snew
Michael Perregaard, Recent Progress inthe Xpress Solvers
Th Vehicle Routing I, Chair: Guy Desaulniers8:30am-10:30am3x30 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
Th Path Problems, Chair: Yanchao Liu3:15pm-4:45pm2x30 min
Edward He, Dynamic Discretization Dis-covery Algorithms for Time-DependentPath Problems
Yanchao Liu, Drone Path Planning andAerial Traffic Flow
Th Computational OR in Julia/JuMP, Organizer: Miles Lubin5:00pm-6:30pm3x30 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
Fr Hybrid Algorithms and Matheuristics for VRP, Organizer: Thibaut Vidal8:30am-10:30am4x30 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
Fr Computational Integer Programming I, Organizer: Domenico Salvagnin3:15pm-4:45pm3x30 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
Fr Computational Integer Programming II, Organizer: Domenico Salvagnin5:00pm-6:30pm3x30 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
31
Room GINTRAC - Build Q - Ground Floor - Zone 8Mo Polynomial and tensor optimization I, Organizer: Jiawang Nie3:15pm-4:45pm3x30 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
Mo Gradient Methods for Constrained Optimization Problems, Organizer: Igor Konnov5:00pm-6:30pm3x30 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
Tu Stochastic and Nonlinear Optimization I, Organizer: Jorge Nocedal8:30am-10:30am4x30 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
Tu Sum-of-squares and moment problems: methods and applications, Organizer: Etienne De Klerk3:15pm-4:45pm3x30 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
We Stochastic and Nonlinear Optimization III, Organizer: Jorge Nocedal8:30am-10:30am4x30 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
We The power and limits of the Lasserre hierarchy, Organizer: Markus Schweighofer3:15pm-4:45pm3x30 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
We Software for Nonlinear Optimization, Organizer: Sven Leyffer5:00pm-6:30pm3x30 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
Th Recent advances in interior point methods and NLP, Organizer: Michael Todd8:30am-10:30am4x30 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
Fr Stochastic and Nonlinear Optimization II, Organizer: Jorge Nocedal8:30am-10:30am4x30 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
Fr Interior Point Methods in Engineering Applications I, Organizer: Jacek Gondzio3:15pm-4:45pm3x30 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
Fr Moment relaxations for polynomial optimization with symmetries, Organizer: Markus Schweighofer5:00pm-6:30pm3x30 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
32
Room Salle LC4 - Build L - Intermediate 1 - Zone 9Tu Advances in Bundle Methods for Convex Optimization, Organizer: Christoph Helmberg8:30am-10:30am4x30 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
We Recent advances in first-order algorithms for non-smooth optimization, Organizer: Thomas Pock8:30am-10:30am4x30 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
Th Universal methods in non-smooth analysis, Organizer: Alexander Gasnikov8:30am-10:30am4x30 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
Th Efficient Semismooth Newton Methods for Large Scale Statistical Optimization Problems,Organizer: Defeng Sun
5:00pm-6:30pm3x30 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
Fr Geometry in complexity analysis of non-smooth optimization methods, Organizer: Jalal Fadili8:30am-10:30am4x30 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
Fr Nonconvex Optimization: Theory and Methods - Part 3, Organizer: Genaro Lopez5:00pm-6:30pm3x30 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?
33
Room Salle KC6 - Build K - Intermediate 1 - Zone 10Mo Coordinate Descent and Randomized Direct Search Methods, Organizer: Martin Takac3:15pm-4:45pm3x30 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
Mo Complexity of Randomized Algorithms, Organizer: Raghu Pasupathy5:00pm-6:30pm3x20 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
Tu Larges Scale and Distributed Optimization, Organizer: Ermin Wei8:30am-10:30am4x30 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
Tu Recent Advances in Stochastic and Non-convex Optimization II, Organizer: Mingyi Hong3:15pm-4:45pm3x30 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
We First Order Methods for Non-Smooth Constrained Optimization, Organizer: Qihang Lin8:30am-10:30am4x30 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
We Fast Converging Stochastic Optimization Algorithms, Organizer: Francis Bach3:15pm-4:45pm3x30 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
We Non-Convex and Second-order Methods in Machine Learning, Organizer: Martin Takac5:00pm-6:30pm4x20 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
Th Recent Advances on Stochastic Algorithms and Machine Learning, Organizer: Shiqian Ma8:30am-10:30am4x30 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
Th Asynchronous Parallel and Distributed Optimization, Organizer: Wotao Yin3:15pm-4:45pm3x30 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
Th Recent Progress on Second-order Type Optimization Methods, Organizer: Andre Milzarek5:00pm-6:30pm3x20 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
Fr Recent Advances in Coordinate Descent and Constrained Problems, Organizer: Ion Necoara8:30am-10:30am3x30 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
Fr Algorithms for Structured Statistical Optimization, Chair: Ilker Birbil5:00pm-6:30pm4x20 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
34
Room Salle LC5 - Build L - Intermediate 1 - Zone 10Mo Algorithms for nonlinear conic problems, Chair: Takayuki Okuno3:15pm-4:45pm3x30 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
Mo Convergence and Approximation in Conic Programming, Chair: Tamás Terlaky5:00pm-6:30pm3x30 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
Tu Theory and algorithms in conic linear programming 1, Organizer: Gabor Pataki8:30am-10:30am4x30 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
Tu Relative Entropy Optimization II, Organizer: Venkat Chandrasekaran3:15pm-4:45pm3x30 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
We New trends II, Chair: Frank Permenter8:30am-10:30am4x30 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
We Reformulation-based solution methods for quadratic programming, Organizer: Dominique Quadri3:15pm-4:45pm3x30 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
We Completely Positive Cones and Applications, Chair: Patrick Groetzner5:00pm-6:30pm4x20 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
Th Geometry and duality in convex optimization, Organizer: Javier F Pena8:30am-10:30am4x30 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
Th Noncommutative polynomial optimization: semidefinite relaxations, free convexity and applications toquantum information II, Organizer: Monique Laurent
3:15pm-4:45pm3x30 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
Th Using coning programming in problems solving, Chair: Kurt Majewski5:00pm-6:30pm4x20 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
Fr Stability and scaling in conic programming, Chair: Diego Cifuentes8:30am-10:30am4x30 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
Fr Relative Entropy Optimization I, Organizer: Venkat Chandrasekaran3:15pm-4:45pm3x30 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
Fr Sparse Semidefinite Programming, Organizer: Somayeh Sojoudi5:00pm-6:30pm3x30 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
35
Room Salle KC7 - Build K - Intermediate 2 - Zone 10Mo Sparse Recovery, Chair: Mustafa C Pinar3:15pm-4:45pm3x30 min
John Chinneck, LP-based Sparse SolutionsRevisited
Mustafa Pinar, Sparse Recovery and Con-vex Quadratic Splines
Olof Troeng, Efficient `0 Trend Filtering
Tu Unconstrained Optimization, Chair: Ekkehard Sachs8:30am-10:30am4x30 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
Tu Bridging NLP and Theoretical Computer Science, Organizer: Aleksander Madry3:15pm-4:45pm3x30 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
We Computational advances in NLP, Chair: Jeffrey CH Pang8:30am-10:30am4x30 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
Th First Order Methods I, Chair: Sandra A. Santos8:30am-10:30am4x30 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
Th First Order Methods II, Chair: Guillaume Berger5:00pm-6:30pm3x20 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
Fr Regularization and Iterative Methods in Large-Scale Optimization, Organizer: Jacek Gondzio8:30am-10:30am4x30 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
Fr Subspace methods in NLP II, Organizer: Panos Parpas5:00pm-6:30pm3x30 min
Panos Parpas, Distributed Subspace De-composition
Emre Mengi, Subspace Frameworks forEigenvalue Optimization
Jaroslav Fowkes, A block-coordinateGauss-Newton method for nonlinear leastsquares
36
Room Salle 05 - Build Q - 1st floor - Zone 11Mo Convex regularization and inverse problems, Organizer: Pierre Weiss3:15pm-4:45pm3x30 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
Mo Polynomial and tensor optimization III, Organizer: Jiawang Nie5:00pm-6:30pm4x20 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
Tu Machine learning and sparse optimisation , Organizer: Coralia Cartis8:30am-10:30am4x30 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
Tu Interior Point Methods in Engineering Applications II, Organizer: Jacek Gondzio3:15pm-4:45pm2x30 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
We Optimality conditions in NLP and conic problems, Organizer: Roberto Andreani8:30am-10:30am4x30 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
We Subspace methods in NLP I, Organizer: Michal Kocvara3:15pm-4:45pm3x30 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
We Conjugate Gradient Methods, Chair: Giovanni Fasano5:00pm-6:30pm3x30 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
Th Machine learning for optimisation, Organizer: Coralia Cartis8:30am-10:30am4x30 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
Th Methods of Optimization in Riemannian Manifolds, Organizer: Orizon P Ferreira3:15pm-4:45pm3x30 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
Th Polynomial and tensor optimization II, Organizer: Jiawang Nie5:00pm-6:30pm4x20 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
Fr First order methods, Organizer: Gerardo Toraldo8:30am-10:30am4x30 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
Fr Nonlinear Optimization, Chair: Marc C Steinbach3:15pm-4:45pm3x30 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
Fr Primal-dual and ADMM algorithms for nonlinear programming, Organizer: Marco Sciandrone5:00pm-6:30pm4x20 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
37
Room Salle 06 - Build Q - 1st floor - Zone 11Mo Proximal Methods for Structured Problems, Organizer: Ting Kei Pong3:15pm-4:45pm3x30 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
Mo Nonlinear Optimization and Variational Inequalities VI, Organizer: Cong Sun5:00pm-6:30pm4x20 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
Tu Nonlinear Optimization and Variational Inequalities V, Organizer: Xin Liu8:30am-10:30am4x30 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
Tu Nonlinear Optimization and Variational Inequalities III, Organizer: Xin Liu3:15pm-4:45pm3x30 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
We Stochastic Optimization and Variational Inequalities II, Organizer: Alejandro R. Jofre8:30am-10:30am2x30 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
We Optimization Algorithms and Variational Inequalities II, Organizer: Xiaoqi Yang3:15pm-4:45pm3x30 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
We Complementarity Problems, Organizer: Samir K. Neogy5:00pm-6:30pm3x30 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
Th Nonlinear Optimization and Variational Inequalities I, Organizer: Xin Liu8:30am-10:30am4x30 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
Th Nonlinear Optimization and Variational Inequalities II, Organizer: Cong Sun3:15pm-4:45pm3x30 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
Th VU-decomposition techniques for nonsmooth optimization, Organizer: Claudia Sagastizabal5:00pm-6:30pm3x30 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
Fr Stochastic Optimization and Variational Inequalites, Organizer: Hailin Sun8:30am-10:30am4x30 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
Fr Algorithms for optimization and variational problems with possibly nonisolated solutions II,Organizer: Alexey F. Izmailov
3:15pm-4:45pm3x30 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
Fr Nonlinear Optimization and Variational Inequalities IV, Organizer: Cong Sun5:00pm-6:30pm3x30 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
38
Room Salle 9 - Build N - 4th floor - Zone 12Mo Adaptivity in non smooth optimization, Organizer: Masaru Ito3:15pm-4:45pm2x30 min
Masaru Ito, An adaptive first ordermethod for weakly smooth and uniformlyconvex problems
Somayya Komal, A Subgradient Algorithmfor solving variational Inequality Problem
Mo Modeling in NLP, Chair: Laura Balzano5:00pm-6:30pm3x20 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
Tu Linear Optimization III, Chair: Rodrigo Mendoza Smith3:15pm-4:45pm3x30 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
We Fixed Point Approaches, Chair: Poom Kumam8:30am-10:30am4x30 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
We Quadratic Optimization, Chair: Anders Forsgren3:15pm-4:45pm3x30 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
We Linear Optimization II, Chair: Julian Hall5:00pm-6:30pm3x30 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
Th Non smooth optimization for lage scale poblems, Organizer: Yu Du8:30am-10:30am4x30 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
Th Large-scale combinatorial optimization implementations, Organizer: Aaron Archer5:00pm-6:30pm4x20 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
Fr Decomposition Methods, Chair: Roger Behling8:30am-10:30am4x30 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
Fr Linear Optimization I, Chair: Jianming Shi5:00pm-6:30pm3x20 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
39
Room Salle 8 - Build N - 4th floor - Zone 12Mo Nonconvex Optimization: Theory and Methods - Part 1, Organizer: Shoham Sabach3:15pm-4:45pm3x30 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
Mo Extending the Reach of First-Order Methods, Part I, Organizer: Haihao Lu5:00pm-6:30pm3x30 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
Tu Addressing problems with complex geometries, Organizer: Edouard Pauwels8:30am-10:30am4x30 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
Tu Nonconvex Optimization: Theory and Methods - Part 2, Organizer: Russell Luke3:15pm-4:45pm3x30 min
Guoyin Li, Splitting methods for noncon-vex feasibility problems
Patrick Johnstone, Projective Splittingwith Forward Steps
Russell Luke, Convergence Analysis forNonconvex Optimization Made Easy
We Dynamical Systems and Optimization, Organizer: Hedy Attouch8:30am-10:30am4x30 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
We Adaptivity in non-smooth optimization, Organizer: Volkan Cevher3:15pm-4:45pm3x30 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
We Methods and Analysis for Nonsmooth Optimization, Organizer: Michael L Overton5:00pm-6:30pm3x30 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
Th First-order methods for nonconvex and pathological convex problems, Organizer: Wotao Yin8:30am-10:30am4x30 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
Th Extending the Reach of First-Order Methods, Part II, Organizer: Robert M. Freund3:15pm-4:45pm3x30 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
Th Different faces of nonsmoothness in optimization, Organizer: Tim Hoheisel5:00pm-6:30pm3x30 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
Fr Convergence analysis for non smooth optimization, Organizer: Robert Csetnek8:30am-10:30am4x30 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
Fr Advances in the first-order methods for convex optimization, Organizer: Angelia Nedich3:15pm-4:45pm3x30 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
Fr Nonsmooth DC optimization with applications, Chair: Napsu Karmitsa5:00pm-6:30pm3x30 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
40
Room Auditorium - Build Symph H - Gambetta - Zone 0Mo On the relationship between machine learning and optimization, Organizer: Michel Goemans11:00am-12:00am1x60 min
Francis Bach, On the relationship betweenmachine learning and optimization
Mo Multiobjective Optimization with PDE Constraints, Organizer: Stephen J Wright1:30pm-2:30pm1x60 min
Michael Hintermuller, MultiobjectiveOptimization with PDE Constraints
Tu Adaptive Robust Optimization with Scenario-wise Ambiguity Sets, Organizer: Daniel Kuhn11:00am-12:00am1x60 min
Melvyn Sim, Adaptive Robust Optimiza-tion with Scenario-wise Ambiguity Sets
Tu The Resurgence of Proximal Methods in Optimization, Organizer: Claudia Sagastizabal1:30pm-2:30pm1x60 min
Marc Teboulle, The resurgence of proxi-mal methods in optimization
We Insights via volumetric comparison of polyhedral relaxations, Organizer: Andrea Lodi11:00am-12:00am1x60 min
Jon Lee, Insights via volumetric compari-son of polyhedral relaxations
We Relaxations and Approximations of Chance Constraints, Organizer: Simge Kucukyavuz1:30pm-2:30pm1x60 min
Shabbir Ahmed, Relaxations and Approxi-mations of Chance Constraints
Th The BARON software for MINLP, Organizer: Claudia D Ambrosio11:00am-12:00am1x60 min
Nikolaos Sahinidis, The BARON softwarefor MINLP
Th Randomness, risk and electricity prices, Organizer: Michael C Ferris1:30pm-2:30pm1x60 min
Andy Philpott, Randomness, risk andelectricity prices
Fr Tseng Memorial Lectureship in Continuous Optimization, Organizer: Yaxiang Yuan11:00am-12:00am1x60 minFr Bounds for quantum graph parameters by conic and polynomial optimization, Organizer: Frank Vallentin1:30pm-2:30pm1x60 min
Monique Laurent, Bounds for quantumgraph parameters by conic and polynomialoptimization
41
Room BROCA - Build W - 3rd floor - Zone 0Tu Lower bounds on the size of linear programs, Organizer: Volker Kaibel11:00am-12:00am1x60 min
Thomas Rothvoss, Lower Bounds on theSize of Linear Programs
We Monotone Operator Theory in Convex Optimization, Organizer: Samir Adly11:00am-12:00am1x60 min
Patrick Combettes, Monotone OperatorTheory in Convex Optimization
Th Cutting Planes in the Extended Space, Organizer: Adam N Letchford11:00am-12:00am1x60 min
Oktay Gunluk, Cutting Planes in the Ex-tended Space
Fr Modern Branch-and-Cut Implementation, Organizer: Marc E Pfetsch11:00am-12:00am1x60 min
Matteo Fischetti, Modern Branch-and-Cut Implementation
42