Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Specific Models, Algorithms, and Software - Tuesday 8:30 AM – 10:30 AM FABRE Optimization in Statistical Learning, Organizer: Quentin Berthet, session 326 Learning Build J, Z 8 Ground Floor 4x30 min Jonathan Weed, Near-linear time approxi- mation algorithms for optimal transport Andreas Elsener, Sharp Oracle In- equalities for nonconvex regularized M-estimators Alexandre d Aspremont, Sharpness, Restart and Compressed Sensing Perfor- mance Fan Yang, Towards a deeper understanding of generalization for kernel learning Salle DENUCE Statistics meets optimization: going beyond convexity, Organizer: John Duchi, session 337 Learning Build Q, Z 8 Ground Floor 4x30 min Mahdi Soltanolkotabi, Learning ReLUs and over-parameterized neural networks via gradient descent Ju Sun, When are nonconvex optimization problems not scary? John Duchi, Solving composite optimiza- tion problems, with applications to phase retrieval an Rina Barber, Optimal iterative threshold- ing algorithms for sparse optimization Salle 22 Pricing, Chair: Anastasiya Ivanova, session 478 Learning Build G, Z 6 2nd floor 4x30 min Anastasiya Ivanova, Distributed price ad- justment for the resource allocation prob- lem Yesmine Rouis, Price forecasting with ma- chine learning algorithms for recommerce activities Sara Calleja, Volume forecasting with machine learning algorithms for recom- merce activities Spyros Zoumpoulis, Optimal Pricing and Introduction Timing of New Virtual Ma- chines Salle 18 Path and tree problems, Chair: Arthur J Delarue, session 360 Network Build I, Z 7 1st floor 4x30 min Andreas Karrenbauer, Approximate Shortest Paths and Transshipment in Distributed and Streaming Models Dmytro Matsypura, Exact IP-based ap- proaches for the longest induced path prob- lem. Kiyoshi Sawada, Adding Edges of Short Lengths Incident with the Root to Com- plete K-ary Tree Arthur Delarue, Travel Time Estimation in the Age of Big Data Salle 16 Facility Location, Chair: Ivan Contreras, session 414 Logistics Build I, Z 7 2nd floor 3x30 min Ivan Contreras, Exact solution of single source quadratic capacitated location prob- lems Blas Pelegrin, Optimal multi-facility lo- cation for competing firms under quantity competition Daniel Santos, A new formulation for the Hamiltonian p-median problem Salle 23 Electric Vehicles and Decarbonization, Chair: Martim Joyce-Moniz, session 519 Energy Build G, Z 6 3rd floor 4x30 min Paolo Pisciella, A techno-economic anal- ysis of the impact of decarbonization Francisco Munoz, Equilibrium Analysis of a Carbon Tax With Pass-through Restric- tions Daniel Olivares, Management of EV Charging Stations under Advance Reserva- tions Schemes Martim Joyce-Moniz, Increasing electric vehicle adoption via strategic siting of charging stations Salle 24 Risk Models for Electricity Markets, Chair: Michael C Ferris, session 521 Energy Build G, Z 6 3rd floor 4x30 min Daniel Ralph, Risky Capacity Equilibrium Models for risk averse investment equilib- ria Ryan Cory-Wright, Payment mechanisms, e fficiency savings and risk-aversion in electricity markets Fabio Moret, Risk and Information Shar- ing in Peer-to-Peer Electricity Markets Michael Ferris, Dynamic Risked Equilib- rium for Energy Planning Salle LA4 Interval Global Optimization, Organizer: Frederic Messine, session 339 Sciences Build L, Z 8 Basement 4x30 min Tibor Csendes, Nonlinear Symbolic Trans- formations for Simplifying Functions – In- terval Methods Bertrand Neveu, An Interval Branch and Bound Algorithm for Parameter Estima- tion Dominique Monnet, Interval Branch-and- Bound Algorithm for semi-infinite pro- gramming Frederic Messine, Reliable convex relax- ation techniques for interval global opti- mization codes PITRES LP, Mixed Integer Convex Programming and Decomposition, Organizer: Thorsten Koch, session 236 Algo Build O, Z 8 Ground Floor 4x30 min Miten Mistry, Optimising over Gradient- Boosted Regression Trees with Convex Penalty Functions Nikolaos Ploskas, An advanced initializa- tion procedure for the simplex algorithm Stephen Maher, Experiments with a gen- eral Benders’ decomposition framework for SCIP Christian Puchert, Progress in the Branch-Price-and-Cut Solver GCG Room Invited Talks - Tuesday 11:00 AM – 12:00 AM Auditorium Adaptive Robust Optimization with Scenario-wise Ambiguity Sets, Organizer: Daniel Kuhn, session 551 SEMI Build Symph H, Z 0 Gambetta 1x60 min Melvyn Sim, Adaptive Robust Optimiza- tion with Scenario-wise Ambiguity Sets DENIGES Asymptotic Lagrangian duality for nonsmooth optimization, Organizer: Xiaojun Chen, session 541 KEYNOTE Build C, Z 5 Ground Floor 1x60 min Regina Burachik, Asymptotic Lagrangian duality for nonsmooth optimization BROCA Lower bounds on the size of linear programs, Organizer: Volker Kaibel, session 545 KEYNOTE Build W, Z 0 3rd floor 1x60 min Thomas Rothvoss, Lower Bounds on the Size of Linear Programs Room Invited Talks - Tuesday 1:30 PM – 2:30 PM Auditorium The Resurgence of Proximal Methods in Optimization, Organizer: Claudia Sagastizabal, session 555 PLENARY Build Symph H, Z 0 Gambetta 1x60 min Marc Teboulle, The resurgence of proxi- mal methods in optimization 75 Yüklə 23,3 Mb. Dostları ilə paylaş:
|