Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Continuous Optimization - Tuesday 3:15 PM – 4:45 PM GINTRAC Sum-of-squares and moment problems: methods and applications, Organizer: Etienne De Klerk, session 2 NLP Build Q, Z 8 Ground Floor 3x30 min Amir Ali Ahmadi, LP, SOCP, and Optimization-Free Approaches to Polyno- mial Optimization Krzysztof Postek, Distributionally robust optimization with SOS polynomial density functions and m Georgina Hall, Nonnegative polynomials, and applications to learning Salle KC7 Bridging NLP and Theoretical Computer Science, Organizer: Aleksander Madry, session 51 NLP Build K, Z 10 Intermediate 2 3x30 min Aleksander Madry, Improved Max Flow and 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 for lp regression provably beyond self- concordance Salle 05 Interior Point Methods in Engineering Applications II, Organizer: Jacek Gondzio, session 61 NLP Build Q, Z 11 1st floor 2x30 min Michal Kocvara, A multigrid interior point method for large scale topology op- timization Jacek Gondzio, Solving large-scale truss layout optimization problems by a primal- dual IPM Salle 9 Linear Optimization III, Chair: Rodrigo Mendoza Smith, session 439 NLP Build N, Z 12 4th floor 3x30 min Rodrigo Mendoza Smith, Neural con- straint selection in Linear Programming Chu Nguyen, New station cone algorithm variant for linear programming and com- puting experiment Khalid El Yassini, A predictor-corrector algorithm for lp problems using the mixed penalty approach Salle 8 Nonconvex Optimization: Theory and Methods - Part 2, Organizer: Russell Luke, session 186 NonSmooth Build N, Z 12 4th floor 3x30 min Guoyin Li, Splitting methods for noncon- vex feasibility problems Patrick Johnstone, Projective Splitting with Forward Steps Russell Luke, Convergence Analysis for Nonconvex Optimization Made Easy Salle 20 Recent Advances in Conic Programming I, Organizer: Makoto Yamashita, session 82 SDP Build G, Z 6 1st floor 3x30 min Bissan Ghaddar, Strong and Cheap SDP and SOCP Hierarchies for Polynomial Op- timization Sunyoung Kim, BP: a Matlab package based on the Bisection and Projection method for POPs David Papp, Sum-of-squares optimization with and without semidefinite program- ming Salle LC5 Relative Entropy Optimization II, Organizer: Venkat Chandrasekaran, session 112 SDP Build L, Z 10 Intermediate 1 3x30 min Venkat Chandrasekaran, Newton Poly- topes and Relative Entropy Optimization Timo de Wolff, Optimization over the Hy- percube via Sums of Nonnegative Circuit Polynomials Orcun Karaca, The REPOP Toolbox: Polynomial Optimization Using Relative Entropy Relaxations Salle 06 Nonlinear Optimization and Variational Inequalities III, Organizer: Xin Liu, session 143 Variat Build Q, Z 11 1st floor 3x30 min Xinwei Liu, A primal-dual IPM with rapid detection on infeasibility for nonlinear pro- grams Wei Bian, Some discussion on nonsmooth convex regression with cardinality penalty Bo Wen, Proximal Algorithms with Ex- trapolation for Nonconvex Nonsmooth Problems Salle KC6 Recent Advances in Stochastic and Non-convex Optimization II, Organizer: Mingyi Hong, session 304 RandomM Build K, Z 10 Intermediate 1 3x30 min Tianbao Yang, First-order Stochastic Algo- rithms for Escaping From Saddle Points John Birge, Markov chain Monte Carlo methods for Dynamic Stochastic Opti- mization Jong-Shi Pang, Composite Difference-Max Programs for Modern Statistical Estima- tion Problems Salle 21 Advances in DFO II, Chair: Warren Hare, session 37 DerFree Build G, Z 6 Intermediate 3x30 min Yves Lucet, Variable-fidelity derivative- free algorithms for road design Matt Menickelly, Derivative-Free Robust Optimization by Outer Approximations S´ebastien Le Digabel, The Mesh Adaptive Direct Search algorithm for granular and discrete variables Salle AURIAC Optimal Control and PDE Constrained Optimization, Organizer: Hasnaa Zidani, session 233 Control Build G, Z 6 1st floor 3x30 min Damien Allonsius, Control of semi dis- cretized (in space) systems of parabolic equations. Francesca Chittaro, Strong local optimal- ity for generalised L 1 optimal control prob- lems Zheng Chen, Shortest Dubins Paths through Three Points Room Specific Models, Algorithms, and Software - Tuesday 3:15 PM – 4:45 PM Salle 16 Distributed and Asynchronous Learning, Organizer: Ion Necoara, session 323 Learning Build I, Z 7 2nd floor 3x30 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-dual proximal algorithms for large-scale opti- mization FABRE Advances in large-scale machine learning, Organizer: Mark Schmidt, session 327 Learning Build J, Z 8 Ground Floor 3x30 min Francis Bach, Exponential convergence of testing error for stochastic gradient meth- ods. Volkan Cevher, Mirrored Langevin Dy- namics Zaid Harchaoui, Catalyst Acceleration for Gradient-based Optimization of Structured Models Salle 22 Learning for mixed integer optimization, Chair: Hari Bandi, session 482 Learning Build G, Z 6 2nd floor 2x30 min Hari Bandi, Learning a Mixture of Gaus- sians via Mixed Integer Optimization Takanori Maehara, Learning for Tuning Parameters of NUOPT MILP Solver PITRES Pricing Methods, Organizer: Rafael Martinelli, session 182 Logistics Build O, Z 8 Ground Floor 3x30 min Teobaldo Bulh˜oes J´unior, A branch-and- price algorithm for the Minimum Latency Problem Jacques Desrosiers, Pricing, cycles, and pivots Ruslan Sadykov, Branch-Cut-and-Price Solver for Vehicle Routing Problems Salle 23 Supply Chain and Lot Sizing, Chair: Simon Thevenin, session 534 Scheduling Build G, Z 6 3rd floor 3x30 min Sixiang Zhao, Decision Rule-based Method for Flexible Multi-Facility Capac- ity Planning Problem Kerem Akartunali, Two-Period Relax- ations for Big-Bucket Lot-Sizing: Polyhe- dra and Algorithms Simon Thevenin, Scenario based stochas- tic optimization for the multi-echelon lot- sizing problem Salle DENUCE Equilibrium Modelling in Energy, Organizer: Thomas Kallabis, session 290 Energy Build Q, Z 8 Ground Floor 3x30 min Mirjam Ambrosius, Optimal Price Zones and Investment Incentives in Electricity Markets Thomas Kallabis, Strategic generation in- vestment using a stochastic rollinghorizon MPEC approach Christoph Weber, Coordination Problems in the Coupling of Gas and Electricity Mar- kets Salle 24 Optimization Models for Renewable Energy Integration 2, Chair: Michel Denault, session 523 Energy Build G, Z 6 3rd floor 3x30 min Cristina Corchero, A MIP formulation of a Hybrid AC-DC o ffshore wind power plant topology Kristina Janzen, Optimal Design of a De- centralized Energy Network including Re- newable Energies Michel Denault, Approximate dynamic programming for hydropower optimization Salle LA4 Optimization in Medicine, Organizer: Sebastian Sager, session 394 Sciences Build L, Z 8 Basement 3x30 min Manuel Tetschke, Optimizing the indi- vidual treatment of patients with poly- cythemia vera Nelson Maculan, Combinatorial Problems and Models to Help Prevention and Com- bat Arboviruses Sebastian Sager, Towards optimized consolidation (chemo)therapy for acute myeloid leukemia Salle 18 Optimization software and applications, Chair: Bartolomeo Stellato, session 399 Algo Build I, Z 7 1st floor 3x30 min Bartolomeo Stellato, OSQP: An Opera- tor Splitting Solver for Quadratic Programs Navjot Kukreja, High-level abstractions for checkpointing in PDE-constrained op- timisation Ivet Galabova, A quadratic penalty algo- rithm for linear programming 77 Yüklə 23,3 Mb. Dostları ilə paylaş:
|