Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Continuous Optimization - Wednesday 3:15 PM – 4:45 PM GINTRAC The power and limits of the Lasserre hierarchy, Organizer: Markus Schweighofer, session 9 NLP Build Q, Z 8 Ground Floor 3x30 min Standa Zivny, The power and limits of convex relaxations for general-valued CSPs Adam Kurpisz, On the convergence of the Lasserre /SoS hierarchy for 0/1 optimiza- tion problems. Monaldo Mastrolilli, High Degree SOS Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts Salle 05 Subspace methods in NLP I, Organizer: Michal Kocvara, session 45 NLP Build Q, Z 11 1st floor 3x30 min Zaikun Zhang, A Space Transformation Framework for Nonlinear Optimization: Part I Serge Gratton, A Space Transformation Framework for Nonlinear Optimization: Part II Francisco Sobral, Quasi-Newton and the Unreduced Matrix in Interior Point Meth- ods Salle 9 Quadratic Optimization, Chair: Anders Forsgren, session 417 NLP Build N, Z 12 4th floor 3x30 min David Ek, On limited-memory quasi- Newton methods for minimizing a quadratic function Anders Forsgren, On degeneracy in active-set methods for linear and convex quadratic programming Fernanda Raupp, An algorithm for project- ing a point onto a level set of a quadratic function Salle 8 Adaptivity in non-smooth optimization, Organizer: Volkan Cevher, session 187 NonSmooth Build N, Z 12 4th floor 3x30 min Olivier Fercoq, Adaptive Double Loop Smoothing Algorithms Kfir Levy, Universal Acceleration through Learning Rate Adaptation Stephen Becker, ADMM vs gradient methods for ill-conditioned imaging prob- lems Salle 20 SDP approaches to combinatorial and global optimization problems, Organizer: Etienne De Klerk, session 15 SDP Build G, Z 6 1st floor 3x30 min Samuel Gutekunst, Semidefinite Pro- gramming Relaxations of the Traveling Salesman Problem Hao Hu, On Solving the Quadratic Short- est Path Problem. Ahmadreza Marandi, SDP relaxations of polynomial optimization problems with chordal structure Salle LC5 Reformulation-based solution methods for quadratic programming, Organizer: Dominique Quadri, session 215 SDP Build L, Z 10 Intermediate 1 3x30 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 Assignment Problem Salle 06 Optimization Algorithms and Variational Inequalities II, Organizer: Xiaoqi Yang, session 150 Variat Build Q, Z 11 1st floor 3x30 min Xiaoqi Yang, On Error Bound Moduli for Locally 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 KKT conditions Salle ARNOZAN Nash equilibrium and games 1, Organizer: Lorenzo Lampariello, session 365 Variat Build Q, Z 8 Ground Floor 3x30 min Anna Th¨unen, Solving Multi-Leader- Follower Games Jacqueline Morgan, Nash equilibrium: uniqueness and approximation via contin- uous optimization Mauro Passacantando, Fixed point and ex- tragradient algorithms for quasi-equilibria Salle KC6 Fast Converging Stochastic Optimization Algorithms, Organizer: Francis Bach, session 213 RandomM Build K, Z 10 Intermediate 1 3x30 min Aymeric Dieuleveut, Bridging the Gap between Constant Step Size SGD and Markov Chains Aude Genevay, Stochastic Optimization for Large Scale Optimal Transport Robert Gower, Variance Reduced Meth- ods via Sketching Salle 21 Surrogate-based algorithms for constrained derivative-free problems, Chair: Phillipe R. Sampaio, session 126 DerFree Build G, Z 6 Intermediate 3x30 min Manuel Ramos-Castillo, Optimal agri- cultural scheduling through MINLP surrogate-based optimization Phillipe Sampaio, A global optimization algorithm for derivative-free constrained problems Geovani Grapiglia, Derivative-Free Trust- Region Algorithms for L1, Minimax and Bi-Objective Optimiz Salle AURIAC Risk-Averse PDE-Constrained Optimization–Methods and Applications, Organizer: Harbir Antil, session 222 Control Build G, Z 6 1st floor 3x30 min Ruediger Schultz, Stochastic Dominance in Elastic Shape Optimization Harbir Antil, Weighted Sobolev Spaces with Application to Image Processing Drew Kouri, Smoothing Techniques for Risk-Averse PDE-Constrained Optimiza- tion 82 Room Specific Models, Algorithms, and Software - Wednesday 3:15 PM – 4:45 PM Salle DENUCE Second order methods for training ML models, Chair: Julien Mairal, session 474 Learning Build Q, Z 8 Ground Floor 3x30 min Amir Abdessamad, Newton method with an adjusted generalized Hessian matrix for SVMs Julien Mairal, A Variable Metric Inex- act Proximal Point Algorithm for Quasi- Newton Acceleration Robert Mohr, An Adaptive Sample Size Trust-Region Method for Empirical Risk Minimization FABRE Convex optimization, distances and constraints, Chair: Pablo A Parrilo, session 476 Learning Build J, Z 8 Ground Floor 3x30 min Pavel Dvurechensky, Computational Opti- mal Transport: Accelerated Gradient De- scent vs Sinkhorn Pablo Parrilo, Geodesic distance maxi- mization Adil Salim, A Splitting Algorithm for Minimization under Stochastic Linear Constraints Salle 16 Rail and Maritime Transportation, Chair: Kazuhiro Kobayashi, session 454 Logistics Build I, Z 7 2nd floor 3x30 min Kazuhiro Kobayashi, Accelerated column generation for a ship routing problem with speed optimization Stanley Schade, Column Generation in Railway Optimization Tatsuki Yamauchi, Optimizing Train Stop- ping Patterns for Congestion Management Salle 18 Scheduling in Networks, Chair: Hamish Waterer, session 532 Scheduling Build I, Z 7 1st floor 3x30 min Gratien Bonvin, Global optimization for the pump scheduling problem in drinking water networks Amadeu Coco, Addressing a scheduling problem for planned disruptions on urban road networks Hamish Waterer, Scheduling of mainte- nance windows in a mining supply chain railway network Salle 23 Conic Optimization and Power Systems, Organizer: Jakub Marecek, session 68 Energy Build G, Z 6 3rd floor 3x30 min Arvind Raghunathan, Degeneracy in Chordal Decomposition of Semidefinite Programs Jakub Marecek, When to switch from a convex relaxation to Newton’s method on the non-convex POP Konstantin Turitsyn, Convex restrictions of power flow feasibility sets Salle 24 Emerging Energy Markets, Organizer: Dennice F. Gayme, session 291 Energy Build G, Z 6 3rd floor 2x30 min Maryam Kamgarpour, Designing coalition-proof mechanisms - the case of electricity markets Sean Meyn, Irrational Agents and the Power Grid Salle LA4 Air Transportation and Air Tra ffic Management, Organizer: Sonia Cafieri, session 315 Sciences Build L, Z 8 Basement 3x30 min Ahmed Khassiba, A two-stage stochastic model for scheduling aircraft arrivals un- der uncertainty Fernando Dias, Aircraft conflict resolution and heading recovery with mixed-integer programming Sonia Cafieri, MINLP for aircraft conflict avoidance via speed and heading angle de- viations PITRES Progress in Conic and MIP Solvers, Organizer: Imre Polik, session 237 Algo Build O, Z 8 Ground Floor 3x30 min Jean-Hubert Hours, Artelys Knitro 11.0, a new conic solver and other novelties Erling Andersen, MOSEK version 9 Franz Wesselmann, Recent enhancements in MATLAB Optimization Toolbox solvers for LP and MILP Salle 22 Structure Detection in Integer Programming, Organizer: Taghi Khaniyev, session 272 Algo Build G, Z 6 2nd floor 3x30 min Taghi Khaniyev, Automatic structure de- tection in mixed integer programs Michael Bastubbe, Modular Detection of Model Structure in Integer Programming Jonas Witt, A Computational Investiga- tion on Generic Cutting Planes in Branch- Price-and-Cut Room Invited Talks - Wednesday 3:15 PM – 4:45 PM SIGALAS Logistics, Chair: Frieder Smolny, session 388 INTERFACE Build C, Z 2 2nd floor 3x30 min Kaj Holmberg, Using OpenStreetMap data for route optimization: extraction and re- duction Gw´ena¨el Rault, Modeling the Periodic Vehicle Routing Problem in an industrial context Frieder Smolny, Multiscale optimization of logistics networks Room Discrete Optimization & Integer Programming - Wednesday 5:00 PM – 6:30 PM Salle 43 IP-Formulations, Chair: Temitayo Ajayi, session 516 IPtheory Build C, Z 1 3rd floor 2x30 min Wolfgang Riedl, The quadratic assign- ment problem: a comparison of two lin- earizations Temitayo Ajayi, Assessing Parametrized Linear Programming Relaxations With Su- peradditive Duality Salle 44 Exact Approaches for Vehicle Routing and Variants, Organizer: Ricardo Fukasawa, session 288 IPpractice Build C, Z 1 3rd floor 3x30 min Ricardo Fukasawa, The Capacitated Vehi- cle Routing Problem with Stochastic De- mands Claudio Contardo, Efficient metaheuristic pricing in vehicle routing Rafael Martinelli, Exact Solution of a Class of Vehicle Scheduling Problems DURKHEIM MINLP (III), Organizer: Daniel Bienstock, session 67 MINLP Build A, Z 1 3rd floor 3x30 min Alberto Del Pia, Cardinality-constrained linear regression with sparse matrices Guanyi Wang, Computational evaluation of new dual bounding techniques for sparse PCA Jeff Linderoth, Cutting Planes for Lin- ear Programs with Complementarity Con- straints Salle 34 Robust Approaches for Challenging Uncertain Optimization Problems, Organizer: Frauke Liers, session 124 MINLP Build B, Z 3 1st floor 3x30 min Timo Gersing, A New Approach for Ex- tending Cover Inequalities for the Robust Knapsack Polytope Andreas Schmitt, An Interdiction Ap- proach for the Design of High-Rise Water Supply Systems Sebastian Tschuppik, Robust optimization with selected scenarios Salle 35 Advances in MINLP, Organizer: Laura Palagi, session 165 MINLP Build B, Z 4 Intermediate 3x30 min Marianna De Santis, An Active Set Algo- rithm for Robust Combinatorial Optimiza- tion Veronica Piccialli, Membrane System De- sign Optimization Emiliano Traversi, Dantzig Wolfe Decom- position for Binary Quadratic Program- ming LEYTEIRE Approximation Algorithms for Geometric Packing Problems, Organizer: Fabrizio Grandoni, session 28 APPROX Build E, Z 1 3rd floor 3x30 min Fabrizio Grandoni, Approximating Geo- metric Knapsack via L-Packings Andreas Wiese, Parameterized (1+eps)- approximation algorithms for packing problems Klaus Jansen, Closing the gap for pseudo- polynomial strip packing Salle 36 Online Optimization, Organizer: Kevin Schewior, session 35 APPROX Build B, Z 4 Intermediate 3x30 min Victor Verdugo, How large is your graph? Andreas T¨onnis, Submodular Secretary Problems: Cardinality, Matching, and Lin- ear Constraints Kevin Schewior, Tight Competitive Anal- ysis for Online TSP on the Line Salle 41 Connectivity problems and Steiner trees, Chair: Andreas E Feldmann, session 421 COMB Build C, Z 1 3rd floor 4x20 min Marcus Brazil, Computing minimum 2- connected Steiner networks in the Eu- clidean plane Yasuko Matsui, Enumerating All Span- ning Subgraphs with Edge-Connectivity at Least k Mark Turner, The variable-cost node- weighted Steiner tree problem in the Eu- clidean plane. Andreas Feldmann, Parameterized Ap- proximation Algorithms for Bidirected Steiner Network Problems Salle 39 Shortest paths and cutting stock, Chair: Arnaud Vandaele, session 426 COMB Build E, Z 1 3rd floor 4x20 min Pedro de las Casas, Cost Projection Meth- ods for the Shortest Path Problem with Crossing Costs Adam Schienle, Solving the Time- Dependent Shortest Path Problem using Super-Optimal Wind Miriam Schl¨oter, Earliest Arrival Trans- shipments in Networks With Multiple Sinks Arnaud Vandaele, One-dimensional cut- ting stock instances for which few patterns are needed 83 Yüklə 23,3 Mb. Dostları ilə paylaş:
|